一道动归问题

                           Card Game
   The multiplication puzzle is played with a row of cards,each containing a single positive integer.The player takes one card out of the row and scores the number of points equal to the number on the card taken and the numbers on the cards on the left and right of it. It is not allowed to take out the first and the last card in the row.
The goal is to take cards in such order as to minimize the total number of socred points.
For example, if cards in the row contain numbers 10 1 50 20 5, player might take a card with 1,then 20,then50,scoring
10*1*50+50*20*5+10*50=8000
if he would take the cards in the opposite order,i.e.50,then 20, then 1,scoring
1* 50*20+1*20*5+10*1*5=1150.

Input:
The first line contains the number of cards N(3<=N<=1000)
The seconde line contains N integers in the range from 1 to 100, separated by spaces.
Ouput:
Ouput a single integer--the minimal score.
Examples:
4
5 4 1 3
35
-----------
3
1 2 3
6
 

#include  < iostream >
#include  < cstring >
using   namespace  std;
const   int  total = 1000 ;
int  f[total][total];
int  value[total];
int  n;
void  Init()
... {
  memset(f,0,sizeof(f));
  memset(value,0,sizeof(value));     
}
void  Input()
... {
    Init();
    int i;
    cin>>n;
    for(i=0;i<n;i++)
     cin>>value[i];    
}
void  Solve()
... {
    int i,j,k,m,min,tmp;
     for(i=0;i<n-1;i++)
       f[i][i+1]=0;
     for(k=2;k<n;k++)
      for(i=0;i+k<n;i++)
       ...{
         j=i+k;
         min=f[i+1][j]+value[i]*value[i+1]*value[j];
           for(m=i+2;m<j;m++)
           ...{
                tmp=f[i][m]+f[m][j]+value[i]*value[m]*value[j];
                if(tmp<min) min=tmp;
           } 
           f[i][j]=min;     
       } 
    cout<<f[0][n-1]<<endl;
}
int  main()
... {
    
    Input();
    Solve();
    system("pause");
return 0;
}

O(n^3)的算法，n=1000时估计抗不住。。。。。好的算法没想到，好长时间没比赛思维都退化了。。