POJ1651Multiplication Puzzle题解动态规划DP
来源:互联网 发布:数据库入门哪个好 编辑:程序博客网 时间:2024/06/05 17:24
Multiplication Puzzle
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3460 Accepted: 2034
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
状态:
d[i][j]表示第i个数到第j个数合并的最小值
状态转移方程:
d[i][j]=min(d[i][j],d[i][k]+d[k][j]+a[i]*a[j]*a[k])
i<k<j
代码:
- POJ1651Multiplication Puzzle题解动态规划DP
- poj1651Multiplication Puzzle 区间dp
- POJ1651Multiplication Puzzle(区间dp)
- poj1651Multiplication Puzzle(取数,区间DP)
- poj1651Multiplication Puzzle
- poj1651Multiplication Puzzle
- Bookshelf题解动态规划DP
- POJ2353Ministry题解动态规划DP
- POJ1260Pearls题解动态规划DP
- HDU2845Beans题解动态规划DP
- POJ3356AGTC题解动态规划DP
- POJ1745Divisibility题解动态规划DP
- HDU3449Consumer题解动态规划DP
- POJ2626Chess题解动态规划DP
- POJ1837Balance题解动态规划DP
- POJ3661Running题解动态规划DP
- POJ2229Sumsets题解动态规划DP
- POJ1036Gangsters题解动态规划DP
- ZOJ 1002 Fire Net
- MSSQL聚集索引與非技術索引設計指南
- 你怀疑过“温水煮青蛙”的故事吗
- [Language-regex]正则语法整理——符号篇
- [code] em
- POJ1651Multiplication Puzzle题解动态规划DP
- Mysql 字符集
- Ubuntu9.10下编译Android源码
- 解决oracle9i开始选项的 Enterprise Manager Console 选项丢失的问题
- 创建者模式(Builder)
- 配置REDHAT 5的yum使用CentOS 5的源
- 32位嵌入式微处理器一览
- NP P NPC 问题详解
- NP P NPC 问题详解