test：合并石子加强版

原来的合并石子是两堆两堆合并…这里要求三堆三堆合并
输入数据：n<=400

样例input：5 1 2 3 4 5
样例output：21

---

【分析】
用辅助数组 f[i][j] = min(f[i][j],dp[i][k]+dp[k+1][j])，将区间的O(n^4)枚举断点复杂度降到了O(n^3)

---

【代码】

//merge
#include<iostream>
#include<cstring>
#include<cstdio>
#define inf 1000000000
#define fo(i,j,k) for(i=j;i<=k;i++)
using namespace std; 
const int mxn=405;
int n,ans=1e9*2;
int s[mxn],dp[mxn*2][mxn*2]; //dp表示i~j合并完成的最小分值 
int f[mxn*2][mxn*2]; //f[i][j]=min(dp[i][k],dp[k+1][j])
int main()
{
    freopen("merge.in","r",stdin);
    freopen("merge.out","w",stdout);
    int i,j,k;
    scanf("%d",&n);
    fo(i,0,n)
      fo(j,0,n) 
        dp[i][j]=f[i][j]=inf;
    memset(f,0x3f,sizeof f);
    fo(i,1,n) scanf("%d",&s[i]);
    fo(i,1,n) s[i]+=s[i-1];
    //初始化 
    fo(i,1,n) dp[i][i]=0,f[i][i+1]=s[i+1]-s[i-1];
    //dp
    for(i=n;i>=1;i--)
      for(j=i;j<=n;j++)
      {
          for(k=i;k<j;k++)
            dp[i][j]=min(dp[i][j],dp[i][k]+f[k+1][j]+s[j]-s[i-1]);
          for(k=i;k<j;k++)
            f[i][j]=min(f[i][j],dp[i][k]+dp[k+1][j]);
      }
    printf("%d\n",dp[1][n]);
    return 0;
}