282. 石子合并
输入样例:
4
1 3 5 2
思路分析:
代码展示:
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 310, INF = 0x3f3f3f3f;
int n, s[N];
int f[N][N];
int main()
{
cin >> n;
for (int i = 1; i <= n; i ++) cin >> s[i], s[i] += s[i - 1];
// 枚举区间长度
// 当len = 1时,表示只有一堆石子,没有必要枚举
for (int len = 2; len <= n; len ++)
{
// 枚举区间起点
for (int i = 1; i + len - 1 <= n; i ++)
{
// j为区间终点
int j = i + len - 1;
f[i][j] = INF;
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;
}