代码:
#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[l][r] = 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[l - 1]);
//因为f[l][k]和f[k + 1][r]还得融合一次 所以还得加上 s[r] - s[l - 1]
//这里边的f[l][k]和f[k + 1][r]可能在之前len=2 3 4。。。时计算过
}
printf("%d\n", f[1][n]);
return 0;
}
/*
两个两个 三个三个一下下 精打细算
*/