51nod 1021 石头归并

 1 #include<stdio.h>
 2 #include<string.h>
 3 #include<algorithm>
 4 #include<iostream>
 5 using namespace std;
 6 const int INF = 1 << 30;
 7 int sum[1005];
 8 int vis[1005];
 9 int dp[1005][1005];
10 int main(){
11     int n;
12     while(~scanf("%d",&n)){
13         int i,len,temp;
14         memset(vis,0,sizeof(vis));
15         memset(sum,0,sizeof(sum));
16         memset(dp,0,sizeof(dp));
17         for(i=1;i<=n;i++){
18             scanf("%d",&vis[i]);
19             sum[i]=sum[i-1]+vis[i];
20         }
21         for(len=1;len<n;len++){
22             for(i=1;i+len<=n;i++){
23                 dp[i][i + len] = INF;
24                 temp=sum[i+len]-sum[i-1];
25                 for(int k=i;k<i+len;k++)
26                     dp[i][i+len]=min(dp[i][i+len],dp[i][k]+dp[k+1][i+len]+temp);
27             }
28         }
29         printf("%d\n",dp[1][n]);
30     }
31 }