poj-1651 multiplication puzzle(区间dp)
生命楂fit人qvod,异世灵武天下阿甘,折磨美女
time limit1000 ms
memory limit65536 kb
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
#include<iostream>
#include<algorithm>
#include<cstring>
#include<sstream>
#include<cmath>
#include<cstdlib>
#include<queue>
#include<stack>
using namespace std;
#define pi 3.14159265358979323846264338327950
#define inf 0x3f3f3f3f;
int n,i,j,k,l;
int dp[110][110];
int a[1010];
void solve()
{
for(l=2;l<=n;l++)
{
for(i=2;i+l<=n+1;i++)
{
j=i+l-1;
dp[i][j]=inf;
for(k=i;k<j;k++)
dp[i][j]=min(dp[i][j],dp[i][k]+dp[k+1][j]+a[i-1]*a[k]*a[j]);
}
}
printf("%d\n",dp[2][n]);
}
int main()
{
while(~scanf("%d",&n))
{
memset(dp,0,sizeof(dp));
for(int i=1;i<=n;i++)
cin>>a[i];
solve();
}
}
如对本文有疑问,请在下面进行留言讨论,广大热心网友会与你互动!!
点击进行留言回复
相关文章:
-
-
C++ 作用域
作用域:名称在翻译单元(包括文件)的可见范围 局部: 只在定义它的代码块中可用,如自动变量 全局(文件作用域): 从定义位置到文件结尾都可用 注意: 静...
[阅读全文]
-
-
-
-
聚合类型与POD类型
Lippman在《深度探索C++对象模型》的前言中写道: I have heard a number of people over the years ...
[阅读全文]
-
-
-
-
-
网友评论