本题为经典的区间dp问题。
原题如下:
代码如下:
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 310;
int f[N][N];
int a[N];
int s[N];//前缀和数组,用于求区间和
int main()
{
int n;
cin >> n;
for (int i = 1; i <= n; i ++ )
{
cin >> a[i];
s[i] = s[i - 1] + a[i];
}
memset(f, 0x3f, sizeof f);//将初始值置为无穷
for(int len = 1; len <= n; len ++ )//枚举长度
{
for(int i = 1; i + len - 1 <= n; i ++ )//枚举左端点
{
int j = i + len - 1;//确定右端点
if(len == 1)
{
f[i][j] = 0;//初始化合并代价
}
else
{
for(int k = i; k < j; k ++ )//进行合并
{
f[i][j] = min(f[i][j], f[i][k] + f[k + 1][j] + s[j] - s[i - 1]);
}
}
}
}
cout << f[1][n] << endl;
}