题面
题解
石子合并的扩展版,石子合并是链状的,我们这个题是环状的,只需要将环状转换成链状即可
对于环状,我们可以看成图中点,每次合并就是将两个点之间连一条边,最后一次合并一定是将两个链连成一条链,我们就可以发现所有状态其实就是以每个点为结尾断开的情况
对于环状我们一般都是将数组复制一遍转化成链状,然后以0-n-1为头节点,长度为n枚举链,就是所有状态
代码
#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
using namespace std;
const int N = 410;
const int INF = 0x3f3f3f3f;
int n;
int w[N], s[N];
int f[N][N], g[N][N];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> w[i];
w[i + n] = w[i];
}
for (int i = 1; i <= n * 2; i++) s[i] = s[i - 1] + w[i];
memset(f, 0x3f, sizeof f);
memset(g, -0x3f, sizeof g);
for (int len = 1; len <= n; len++) { //枚举长度
for (int l = 1; l + len - 1 <= n * 2; l++) { //枚举左端点
int r = l + len - 1; //右端点
if (l == r) f[l][r] = g[l][r] = 0;
else {
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]);//最小值
g[l][r] = max(g[l][r], g[l][k] + g[k + 1][r] + s[r] - s[l - 1]);//最大值
}
}
}
}
int minn = INF, maxn = -INF;
for (int i = 1; i <= n; i++) { //枚举所有环形才分成链的情况
minn = min(minn, f[i][i + n - 1]);
maxn = max(maxn, g[i][i + n - 1]);
}
cout << minn << endl;
cout << maxn << endl;
return 0;
}