POJ 1651 Multiplication Puzzle(区间DP)
来源:互联网 发布:川普访华 知乎 编辑:程序博客网 时间:2024/05/22 06:20
Multiplication Puzzle
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 8107 Accepted: 5034
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.
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
6
10 1 50 50 20 5
Sample Output
3650
区间DP,区间划分寻找最优值就好了
关于区间DP,可以参照这个博客
http://blog.csdn.net/dacc123/article/details/50885903
#include <iostream>#include <string.h>#include <stdio.h>#include <algorithm>#include <stdlib.h>#include <math.h>using namespace std;#define MAX 10000000int a[105];int n;int dp[105][105];int main(){ while(scanf("%d",&n)!=EOF) { for(int i=1;i<=n;i++) scanf("%d",&a[i]); memset(dp,0,sizeof(dp)); for(int l=2;l<n;l++) { for(int i=1;i+l<=n;i++) { int j=i+l; dp[i][j]=MAX; for(int k=i+1;k<j;k++) { dp[i][j]=min(dp[i][j],dp[i][k]+dp[k][j]+a[i]*a[k]*a[j]); } } } printf("%d\n",dp[1][n]); } return 0;}
- 【DP】 POJ 1651 Multiplication Puzzle 区间DP
- poj-1651 Multiplication Puzzle 区间DP
- POJ 1651 Multiplication Puzzle (区间DP)
- POJ 1651 Multiplication Puzzle (区间dp)
- POJ 1651 Multiplication Puzzle 区间dp(水
- POJ 1651 Multiplication Puzzle(区间dp)
- poj 1651 Multiplication Puzzle (区间DP)
- POJ 1651 Multiplication Puzzle(区间dp)
- poj 1651 Multiplication Puzzle (区间dp)
- poj 1651 Multiplication Puzzle(区间dp)
- POJ 1651 Multiplication Puzzle(区间DP)
- POJ 1651 Multiplication Puzzle(区间dp)
- POJ 1651 - Multiplication Puzzle(区间DP)
- POJ 1651 Multiplication Puzzle(区间DP)
- POJ 1651 Multiplication Puzzle(区间DP 水题)
- poj 1651 Multiplication Puzzle【区间DP】
- POJ 1651 Multiplication Puzzle (区间DP)
- poj 1651 Multiplication Puzzle(区间DP)
- linux 解析包时出错
- C++11 decltype类型指示符
- go语言数组的拷贝
- 判断是手机端还是网页端的方法
- C语言正负数右移左移
- POJ 1651 Multiplication Puzzle(区间DP)
- android 拍照上传照片(新)
- [LeeiCode]77. Combinations
- iOS 判断日期是否是今天
- NFC
- O2O、C2C、B2B、B2C的区别
- C++使用getline获取一行数据
- Guilty Prince
- Java——SAX解析XML文件