CodeForces - 1312E Array Shrinking

Solution

先放一下自己的错误代码：

#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;

const int N = 505;

int n, a[N], dp[N][N];

int read() {
	int x = 0, f = 1; char s;
	while((s = getchar()) > '9' || s < '0') if(s == '-') f = -1;
	while(s >= '0' && s <= '9') x = (x << 1) + (x << 3) + (s ^ 48), s = getchar();
	return x * f;
}

int main() {
	n = read(); memset(dp, 0x3f, sizeof dp);
	for(int i = 1; i <= n; ++ i) a[i] = read(), dp[i][i] = 1;
	for(int len = 2; len <= n; ++ len)
		for(int i = 1; i <= n - len + 1; ++ i) {
			int j = i + len - 1;
			for(int k = i + 1; k < j - 1; ++ k)
				if(a[k] == a[k + 1])
					dp[i][j] = min(dp[i][j], dp[i][k - 1] + dp[k + 2][j] + 1);
			for(int k = i; k < j; ++ k) dp[i][j] = min(dp[i][j], dp[i][k] + dp[k + 1][j]);
		}
	printf("%d\n", dp[1][n]);
	return 0;
}

错误点在于，我只是把数删除，却没有加入 $a[i]+1$。

怎么搞？回想自己的思路，将两个数列因为相等的 $a[k],a[k+1]$ 连接，根本就不知道 $a[i]+1$ 放哪。

其实可以将思路简化，只考虑两个数的合并情况然后用 $a[i]+1$ 覆盖。因为长度是从小到大枚举的，$a[i]+1$ 肯定也可和附近的数合并。可以另开一个数组 $w[i][j]$ 表示合并后的权值。

Code

#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;

const int N = 505;

int n, a[N], dp[N][N], w[N][N];

int read() {
	int x = 0, f = 1; char s;
	while((s = getchar()) > '9' || s < '0') if(s == '-') f = -1;
	while(s >= '0' && s <= '9') x = (x << 1) + (x << 3) + (s ^ 48), s = getchar();
	return x * f;
}

int main() {
	n = read(); memset(dp, 0x3f, sizeof dp);
	for(int i = 1; i <= n; ++ i) a[i] = read(), dp[i][i] = 1, w[i][i] = a[i];
	for(int len = 2; len <= n; ++ len)
		for(int i = 1; i <= n - len + 1; ++ i) {
			int j = i + len - 1;
			for(int k = i; k < j; ++ k) {
				dp[i][j] = min(dp[i][j], dp[i][k] + dp[k + 1][j]);
				if(dp[i][k] == 1 && dp[k + 1][j] == 1 && w[i][k] == w[k + 1][j])
					dp[i][j] = 1, w[i][j] = w[i][k] + 1;
			}
		}
	printf("%d\n", dp[1][n]);
	return 0;
}