POJ 1651 Multiplication Puzzle（区间DP）

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

题目大意：给你n张卡片，你取走第i张（不能取第一张和最后一张），你的得分就是在剩下的卡片中你取走的那一张，前面那一张和后面那一张分数的乘积，让你求出最少得的分数。

dp[i][j]表示在区间[i,j]里取完i+1到j-1这些卡片所得的最少分数。

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define inf 1e9
#define LL long long

using namespace std;

int main(void)
{
    int n,i,j,k,l;
    int a[110],dp[110][110];
    while(scanf("%d",&n)==1)
    {
        for(i=1;i<=n;i++)
            scanf("%d",&a[i]);
        memset(dp,0,sizeof(dp));
        for(i=1;i<n-1;i++)
            dp[i][i+2] = a[i]*a[i+1]*a[i+2];
        for(l=4;l<=n;l++)
        {
            for(i=1;i+l-1<=n;i++)
            {
                j = i+l-1;
                dp[i][j] = inf;
                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\n",dp[1][n]);
    }

    return 0;
}