题意: 给出一串字符串,要求将它划分成尽量少的字符串,使划分后的所有子串都回文。
解法: 设dp[i]为将0~i划分后的最少回文子串数,有如下状态转移:
dp[i] = dp[j] +1,0<=j<i且区间[j+1,i]回文。
/* **********************************************
Author : Nero
Created Time: 2013-8-25 15:36:08
Problem id : UVA 11584
Problem Name: Partitioning by Palindromes
*********************************************** */
#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
#define REP(i,a,b) for(int i=(a); i<(int)(b); i++)
#define clr(a,b) memset(a,b,sizeof(a))
const int INF = ~0u>>2;
int dp[1010];
char s[1010];
int len;
int main() {
int cas;
scanf("%d", &cas);
while(cas--) {
scanf("%s", s+1);
s[0] = '@';
len = strlen(s);
REP(i,0,len) dp[i] = i;
REP(i,1,len) {
dp[i] = min(dp[i], dp[i-1] + 1);
for(int j = 1; i - j >= 1 && i + j < len && s[i-j] == s[i+j]; j ++) dp[i+j] = min(dp[i+j], dp[i-j-1] + 1);
if(s[i] == s[i+1]) {
dp[i+1] = min(dp[i+1], dp[i-1] + 1);
for(int j = 1; i - j >= 1 && i + j + 1 < len && s[i-j] == s[i+j+1]; j ++ ) dp[i+j+1] = min(dp[i+j+1], dp[i-j-1] + 1);
}
}
printf("%d\n", dp[len-1]);
}
return 0;
}