bzoj1260[CQOI2007]涂色paint

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

char s[100];
int f[100][100];

int main(){
scanf("%s",s+1);int n=strlen(s+1);
for (int i=1;i<=n;i++) f[i][i]=1;
for (int len=2;len<=n;len++){
for (int l=1;l<n;l++){
int r=l+len-1;if (r>n) break;
f[l][r]=min(f[l][r-1]+!(s[r]==s[r-1]),f[l+1][r]+!(s[l]==s[l+1]));
if (s[l]==s[r]) f[l][r]=min(f[l][r],min(f[l+1][r],f[l][r-1]));
if (l+1<=r-1)
if (s[l]==s[r]) f[l][r]=min(f[l+1][r-1]+1,f[l][r]);
if (s[l]!=s[r]) for (int k=l; k<r; k++) f[l][r]=min(f[l][r],f[l][k]+f[k+1][r]);
}
}
printf("%d\n",f[1]
);
return 0;
}