划分成回文串 Partitioning by Palindromes

简单的dp

//Serene
//紫书p275 划分成回文串 Partitioning by Palindromes
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<cstdio>
#include<cmath>
using namespace std;
const int maxlen=1000+10;
int n,j,len;
bool sf[maxlen][maxlen];
int dp[maxlen];
string x;

int main() {
	scanf("%d",&n);getline(cin,x);
	for(int qaq=1;qaq<=n;++qaq) {
		getline(cin,x);len=x.length();
		memset(sf,0,sizeof(sf));
		memset(dp,0x7f,sizeof(dp));
		for(int i=0;i<=len-1;++i) {
			sf[i][i]=1;j=1;
			while(i-j>=0&&i+j<=len-1&&x[i-j]==x[i+j]) sf[i-j][i+j]=1,j++;
			j=1;
			while(i-j>=0&&i+j-1<=len-1&&x[i-j]==x[i+j-1]) sf[i-j][i+j-1]=1,j++;
		}
		dp[0]=1;
		for(int i=1;i<=len-1;++i){
			if(sf[0][i]) {dp[i]=1;continue;}
			for(int j=0;j<=i-1;++j) if(sf[j+1][i]) dp[i]=min(dp[i],dp[j]+1);
		}
		printf("%d\n",dp[len-1]);
	}
	return 0;
}