区间dp
来源:互联网 发布:andreja pejic 知乎 编辑:程序博客网 时间:2024/05/21 20:23
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, scoring10*1*50 + 50*20*5 + 10*50*5 = 500+5000+2500 = 8000If he would take the cards in the opposite order, i.e. 50, then 20, then 1, the score would be1*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
阅读全文
0 0
- 区间DP
- 区间DP
- 区间DP
- 区间DP
- ##区间dp##
- 区间dp
- 区间DP
- 区间dp
- 区间dp
- 区间dp
- 区间dp
- 区间dp
- 区间dp
- 区间dp
- 区间DP
- 区间DP
- 区间DP
- 区间dp
- HDU
- (转)别只盯着比特币!“野蛮生长”的ICO江湖:2年30倍只是寻常
- 关于函数(二)数组指针和指针数组
- 7.18
- Discuz!教程之通过后台词语过滤功能的简单设置挡住绝大部分垃圾内容
- 区间dp
- jvm内存
- 自定义按钮实现标签栏切换
- PAT a1024题解
- 07、MySQL事务、变量以及触发器
- 两个List集合中不相等的值
- 深度学习笔记(二)
- 基于机器学习的NLP情感分析(二)---- 分类问题
- jquery-easyUI第二篇【综合案例】