P1880 [NOI1995]石子合并
解题思路:
Code:
#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
using namespace std;
const int INF = 0x3f3f3f3f;
const int N = 205;
int w[N], sum[N];
int dp_min[N][N], dp_max[N][N];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%d", &w[i]);
w[i + n] = w[i]; //破环成链 (1、2 …… n、1、2 …… n) 共2n个
sum[i] = sum[i - 1] + w[i];
}
for (int i = n + 1; i <= n + n; ++i) {
sum[i] = sum[i - 1] + w[i];
}
memset(dp_max, 0, sizeof(dp_max));
for (int i = 1; i <= n + n; ++i) {
for (int j = 1; j <= n + n; ++j) {
dp_min[i][j] = (i == j ? 0 : INF);
}
}
for (int len = 2; len <= n; ++len) { //枚举区间长度
for (int i = 1; i + len <= n + n; ++i) { //i区间的左端点
int j = i + len - 1; //j区间的右端点
for (int k = i; k < j; ++k) { //枚举区间内的合并情况
dp_min[i][j] = min(dp_min[i][j], dp_min[i][k] + dp_min[k + 1][j] + sum[j] - sum[i - 1]);
dp_max[i][j] = max(dp_max[i][j], dp_max[i][k] + dp_max[k + 1][j] + sum[j] - sum[i - 1]);
}
}
}
int ans_min = INF, ans_max = 0;
for (int i = 1; i <= n; ++i) {
ans_min = min(ans_min, dp_min[i][i + n - 1]);
ans_max = max(ans_max, dp_max[i][i + n - 1]);
}
printf("%d\n%d\n", ans_min, ans_max);
return 0;
}