[BZOJ 1260] CQOI 2007 涂色paint · 动态规划

#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <iostream>
using namespace std;

char st[55];
int n,f[55][55];

int main(){
	cin>>st+1;n=strlen(st+1);
	memset(f,10,sizeof f);
	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 (st[i]==st[j])
				if (l==1) f[i][j]=1;
				else
				f[i][j]=min(f[i+1][j],f[i][j-1]),
				f[i][j]=min(f[i][j],f[i+1][j-1]+1);
			else 
			for (int k=i;k<j;k++) f[i][j]=min(f[i][j],f[i][k]+f[k+1][j]);
		}
	cout<<f[1]
<<endl;
	return 0;
}