C++ 代码

#include<iostream>
#include<algorithm>
using namespace std;

const int N = 310;
int n;
int s[N];
int f[N][N];

int main()
{
    scanf("%d",&n);
    for(int i = 1;i <= n;i ++ ) scanf("%d",&s[i]);
    for(int i = 1;i <= n;i ++ ) s[i] += s[i - 1];

    for(int len = 2;len <= n; len ++)
       for(int i = 1;i + len - 1 <= n;i ++)
       {
        int l = i,r = i + len - 1;
        f[1][1] = 1e8;
           for(int k = l;k < r;k ++)
            f[l][r] = min(f[l][r],f[l][k] + f[k + 1][r] + s[r] - s[i - 1]); 
       }
       printf("%d\n",f[1][n]);
       return 0;
}