ZOJ 1602

区间动态规划。

#include<string.h>#include<cstdio>#include<cstdlib>#include<vector>#include<iostream>using namespace std;#define MAXINT 0x7fffffff#define maxn 110int f[110][110];int w[110];int main(){int i,j,k,n;while(~scanf("%d",&n)){for(i=1;i<=n;i++)for(j=1;j<=n;j++)f[i][j]=MAXINT;for(i=1;i<=n;i++)cin>>w[i];for(i=1;i<=n;i++)f[i-1][i]=f[i][i]=f[i][i+1]=0;for(i=2;i<n;i++)f[i-1][i+1]=w[i-1]*w[i]*w[i+1];int len;for(len=3;len<=n-1;len++)for(i=1;i+len<=n;i++){j=i+len;for(k=i+1;k<j;k++)f[i][j]=min(f[i][j],f[i][k]+w[i]*w[k]*w[j]+f[k][j]);}cout<<f[1][n]<<endl;}return 0;}