nyoj Splits the string 749

Splits the string

时间限制： 1000 ms  |  内存限制： 65535 KB

难度： 3

描述

Hrdv is interested in a string,especially the palindrome string.So he wants some palindrome string.

A sequence of characters is a palindrome if it is the same written forwards and backwards. For example, 'abeba' is a palindrome, but 'abcd' is not.

A partition of a sequence of characters is a list of one or more disjoint non-empty groups of consecutive characters whose concatenation yields the initial sequence. For example, ('race', 'car') is a partition of 'racecar' into two groups.

Given a sequence of characters, we can always create a partition of these characters such that each group in the partition is a palindrome! Given this observation it is natural to ask: what is the minimum number of groups needed for a given string such that every group is a palindrome?

For example:

'racecar' is already a palindrome, therefore it can be partitioned into one group.

'fastcar' does not contain any non-trivial palindromes, so it must be partitioned as ('f', 'a', 's', 't', 'c', 'a', 'r').

'aaadbccb' can be partitioned as ('aaa', 'd', 'bccb').

Input begins with the number n of test cases. Each test case consists of a single line of between 1 and 1000 lowercase letters, with no whitespace within.

输入

Each test case consists of a single line of between 1 and 1000 lowercase letters, with no whitespace within.

输出

For each test case, output a line containing the minimum number of groups required to partition the input into groups of palindromes.

样例输入

racecar
fastcar
aaadbccb

样例输出

1
7
3

上传者

TC_胡仁东

思路：1个字符里最少的回文 ~n个字符里最少的回文

定义d[i]为长度为I的字符串里最少回文

于是有了这样的动态转移方程：d[i] = min(d[i-1]+1,dp[i]);

初始dp[i] = i;

#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
#define min(a,b) (a<b?a:b)

char s[1002];
int dp[1002];
bool judge(int r,int l)//回文判定
{
    while(l<=r)
    {
        if(s[l++]!=s[r--])
        return 0;
    }
    return 1;
}
int main()
{


    while(~scanf("%s",s+1))
    {
       memset(dp , 0 , sizeof(dp));
       int  len = strlen(s+1);
       for(int i=1;i<=len;i++)
       {
           dp[i] = i ;
           for(int j=1;j<=i;j++)
           {
               if(s[i]==s[j]&&judge(i,j))
                    dp[i]=min(dp[i] , dp[j - 1] + 1);
           }
       }
       cout << dp[len] << endl;
    }
    return 0;
}