P4170 [CQOI2007]涂色(区间dp)

P4170 [CQOI2007]涂色https://www.luogu.com.cn/problem/P4170

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <unordered_map>
#include <cmath>
#include <map>
#include <cctype>
#include <cstdlib>
#include <deque>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 1000010;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)
#define lowbit(x) ((x)&(-x))

char s[150];
int f[150][150];

int main() {
	scanf("%s", s + 1);
	memset(f, 0x3f, sizeof(f));
	int n = strlen(s + 1);
	for (int i = 1; i <= n; i++) {
		f[i][i] = 1;
	}
	for (int l = 1; l < n; l++) {
		for (int i = 1; i <= n - l; i++) {
			int j = i + l;
			if (s[i] == s[j])
				f[i][j] = min(f[i + 1][j], f[i][j - 1]);
			else {
				for (int k = i; k < j; k++) {
					f[i][j] = min(f[i][j], f[i][k] + f[k + 1][j]);
				}
			}
		}
	}
	printf("%d", f[1][n]);
	return 0;
}