P4170 [CQOI2007]涂色

https://www.luogu.org/problem/P4170

#include <cstdio>
#include <iostream>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <vector>
#define ll long long
using namespace std;

const int NN=55,inf=1000000000;
int n,f[NN][NN];
char c[NN];

int main(){
	gets(c+1);n=strlen(c+1);
	for(int i=1;i<=n;i++)
		for(int j=1;j<=n;j++)
			f[i][j]=inf;
	for(int i=1;i<=n;i++) f[i][i]=1;
	for(int l=2;l<=n;l++)
		for(int i=1;i<=n-l+1;i++){
			int j=i+l-1;
			if(c[i]==c[j]) f[i][j]=min(f[i][j-1],f[i+1][j]);//continue;}
			for(int k=i;k<j;k++)
				f[i][j]=min(f[i][j],f[i][k]+f[k+1][j]);
		}
	printf("%d\n",f[1][n]-1);
	return 0;
}