Multiplication Puzzle

Language: Multiplication Puzzle Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 16436   Accepted: 10086 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

 给出一堆数字，每次可以移除一个数字（首尾数字不能移除），移除一个数字可以得到的分数为相邻两个数字以及他本身这三个数的乘积，最终会剩下首尾两个数字。问可以得到的最小分数为多少？

#include <iostream>
#include <cstdio>
#include <string>
#include <cmath>
#include <algorithm>
#include <cstring>
#define rush() int T;cin>>T;while(T--)
#define sf(a) scanf("%d\n",&a)
#define go(a) while(scanf("%d",&a)!=EOF)
#define ms(a,b) memset(a,b,sizeof a)
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define pf(a) printf("%.8lf",a)
#define E 1e-8
using namespace std;
typedef long long ll;
const double pi=acos(-1.0);
const int inf=0x3f3f3f3f;
const int idata=200+5;

int n,m,t;
int i,j,k;
int a[idata];
int dp[idata][idata];

int main()
{
    cin.tie(0);
    iostream::sync_with_stdio(false);
    while(cin>>n)
    {
        for(i=1;i<=n;i++)
        {
            cin>>a[i];
            dp[i][i]=0;
        }
        for(i=1;i<=n;i++)
        {
            dp[i][i+1]=0;
            dp[i][i+2]=a[i]*a[i+1]*a[i+2];
        }
        for(int len=3;len<=n;len++)
        {
            for(i=1,j=len;j<=n;i++,j++)
            {
                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]);
            }
        }
        cout<<dp[1][n]<<endl;
    }
    return 0;
}