POJ 1651 区间dp

http://poj.org/problem?id=1651

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

题目大意：有n个数，最左边的和最右边的不能动，其他的任选一个则得到这个数与其相邻两数(共三个数）乘积的分数，求取完所有的数得到的最低分数。(只剩下最左边和最右边)

思路：区间dp，枚举len从2到n-1，len-1为区间长度，枚举左区间端点i从2开始(最左侧的数不能动)，满足i+len-1<=n，则右端点j=i+len-1，然后枚举分界点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])。

 

#include<iostream>
#include<cstdio>
#include<stack>
#include<cmath>
#include<cstring>
#include<queue>
#include<map>
#include<set>
#include<algorithm>
#include<iterator>
#define INF 0x3f3f3f3f
#define EPS 1e-10
typedef long long ll;
typedef unsigned long long ull;
using namespace std;

int dp[105][105];
int a[105];

int main()
{
	int n;
	scanf("%d",&n);
	memset(dp,INF,sizeof(dp));
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&a[i]);
		dp[i][i]=0;
	}
	for(int len=2;len<=n-1;len++)
	{
		for(int i=2;i+len-1<=n;i++)
		{
			int j=i+len-1;
			for(int 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]);
	return 0;
}