poj-1651 Multiplication Puzzle（区间dp）

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
10150 + 50205 + 10505 = 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
15020 + 1205 + 1015 = 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>
using namespace std;
#define N 105
#define inf 0x3f3f3f3f
int dp[N][N];
int a[N];
int main()
{
	int n;
	cin>>n;
	for(int i=1;i<=n;i++)
		cin>>a[i];
	for(int i=1;i<n;i++)
		dp[i][i+2]=a[i]*a[i+1]*a[i+2];
	for(int len=4;len<=n;len++)
	{
		for(int i=1;i+len-1<=n;i++)
		{
			int j=i+len-1;
			for(int k=i+1;k<j;k++)
			{
				if(dp[i][j]==0)
					dp[i][j]=dp[i][k]+dp[k][j]+a[i]*a[k]*a[j];
				else
					dp[i][j]=min(dp[i][j],dp[i][k]+dp[k][j]+a[i]*a[k]*a[j]);
			}
		}
	}
	cout<<dp[1][n]<<endl;
	return 0;
}