[BZOJ 1068] [SCOI2007] 压缩 【区间 DP 】

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <cstdlib>

using namespace std;

const int MaxL = 50 + 5;

int l, Ans;
int g[MaxL][MaxL][3];

char S[MaxL];

bool Check(int l, int r) {
	if ((r - l + 1) & 1) return false;
	int mid = (l + r) >> 1, t = (r - l + 1) >> 1;
	for (int i = l; i <= mid; ++i) 
		if (S[i] != S[i + t]) return false;
	return true;
}

int Solve(int l, int r, int f) {
	if (g[l][r][f] > 0) return g[l][r][f];
	int ret = r - l + 1, t;
	if (Check(l, r)) {
		t = Solve(l, l + ((r - l) / 2), 2);
		++t; //R
		if (f == 0) ++t; //M
		if (ret > t) ret = t;
 	}
	for (int i = l; i <= r - 1; ++i) {
		if (f != 2) t = Solve(l, i, f) + Solve(i + 1, r, 0);
		else t = Solve(l, i, 2) + (r - i);
		if (ret > t) ret = t;
 	}
	g[l][r][f] = ret;
	return ret;
}

int main() 
{
	scanf("%s", S + 1);
	l = strlen(S + 1);
	Ans = Solve(1, l, 1);
	printf("%d\n", Ans);
	return 0;
}