poj 1651
来源:互联网 发布:中国基础地理数据 编辑:程序博客网 时间:2024/06/05 16:33
Multiplication Puzzle
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3938 Accepted: 2309
Description
The multiplication puzzle is played with a row of cards, each containing a single positive integer. During the move player takes one card out of the row and scores the number of points equal to the product of the number on the card taken and the numbers on the cards on the left and on the right of it. It is not allowed to take out the first and the last card in the row. After the final move, only two cards are left in the row.
The goal is to take cards in such order as to minimize the total number of scored points.
For example, if cards in the row contain numbers 10 1 50 20 5, player might take a card with 1, then 20 and 50, scoring
10*1*50 + 50*20*5 + 10*50*5 = 500+5000+2500 = 8000
If he would take the cards in the opposite order, i.e. 50, then 20, then 1, the score would be
1*50*20 + 1*20*5 + 10*1*5 = 1000+100+50 = 1150.
The goal is to take cards in such order as to minimize the total number of scored points.
For example, if cards in the row contain numbers 10 1 50 20 5, player might take a card with 1, then 20 and 50, scoring
10*1*50 + 50*20*5 + 10*50*5 = 500+5000+2500 = 8000
If he would take the cards in the opposite order, i.e. 50, then 20, then 1, the score would be
1*50*20 + 1*20*5 + 10*1*5 = 1000+100+50 = 1150.
Input
The first line of the input contains the number of cards N (3 <= N <= 100). The second line contains N integers in the range from 1 to 100, separated by spaces.
Output
Output must contain a single integer - the minimal score.
Sample Input
610 1 50 50 20 5
Sample Output
3650
Source
Northeastern Europe 2001, Far-Eastern Subregion
分析:DP,设i和j为最后两个数,有f[i][j]=min(f[i][j],f[i][k]+f[k][j]+v[i]*v[k]*v[j])i<k<j注意初始化。。。
代码:
- poj 1651
- poj 1651
- poj 1651
- POJ 1651
- POJ 1651
- poj 1651
- POJ 1651
- poj 1651
- poj 1651
- POJ 1651
- POJ 1651
- POJ 1651 Multiplication Puzzle
- POJ 1651动态规划
- poj 1651 Multiplication Puzzle
- POJ 1651 Multiplication Puzzle
- poj 1651 DP
- poj 1651 Multiplication Puzzle
- poj acm 1651
- 终于开始学习javal了,遇难题了
- jquery实现tagcloud,带3d效果。
- (转)vc图像处理入门之一
- 浅析C标准I/O库
- Makefile 隐式规则
- poj 1651
- 理解JavaScript的caller,callee,call,apply(转自:http://www.ijavascript.cn/jiaocheng/caller-callee-call-apply-464.html)
- VMware_Workstation 6. 0以上版本虚拟机与华为3G无线上网卡驱动有冲突
- C++ 对象的内存布局
- Directfb窗口管理分析之初始化
- Jquery导航栏插件
- vs2005 调试
- sqlSQL2008如何创建定时作业
- VS2008 快捷键