poj1651 Multiplication Puzzle

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[i][j]为[i,j]区间内除了i，j两点外，里面的所有点都炸完所要的代价，这样只要枚举最后炸的点就行了。

#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<string>
#include<algorithm>
using namespace std;
#define maxn 106
#define inf 999999999
int a[maxn];
int dp[maxn][maxn],s[maxn][maxn];
int main()
{
    int n,m,i,j,len,k;
    while(scanf("%d",&n)!=EOF)
    {
        for(i=1;i<=n;i++){
            scanf("%d",&a[i]);
        }
        for(i=1;i<=n-1;i++)dp[i][i+1]=0;

        for(i=1;i<=n-2;i++){
            j=i+2;
            s[i][j]=i+1;
            dp[i][j]=a[i]*a[i+1]*a[i+2];
        }
        for(len=4;len<=n;len++){
            for(i=1;i+len-1<=n;i++){
                j=i+len-1;
                dp[i][j]=inf;
                for(k=s[i][j-1];k<=s[i+1][j];k++){
                    if(dp[i][j]>dp[i][k]+dp[k][j]+a[i]*a[k]*a[j]){
                        s[i][j]=k;
                        dp[i][j]=dp[i][k]+dp[k][j]+a[i]*a[k]*a[j];
                    }
                }
                /*for(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
",dp[1][n]);

    }
    return 0;
}