UVA 11584 Partitioning by Palindromes 回文串dp

Partitioning by Palindromes

Time Limit:1000MS     Memory Limit:0KB     64bit IO Format:%lld & %llu

Submit  Status

Appoint description:  System Crawler  (2013-05-30)

Description

Problem H: Partitioning by Palindromes

We say a sequence of characters is a palindrome if it is the same written forwards and backwards. For example, 'racecar' is a palindrome, but 'fastcar' 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.

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

Sample Input

3
racecar
fastcar
aaadbccb

Sample Output

1
7
3

#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;

const int INF=1e9;

int vis[1111][1111];

int main()
{
    int n;
    cin>>n;
    char str[1111];
    int f[1111];
    while(n--)
    {
        int len,i,j;
        memset(f,0,sizeof(f));
        memset(vis,0,sizeof(vis));
        scanf("%s",str+1);
        len=strlen(str+1);
        for(i=1;i<=len;i++)
        {
            vis[i][i]=1;
            if(str[i]==str[i+1]&&i+1<=len)  vis[i][i+1]=1;

        }
        for(i=1;i<=len;i++)
        {
            for(j=1;j+i<=len;j++)
            {
                if(str[j]==str[j+i]&&vis[j+1][j+i-1])
                    vis[j][j+i]=1;
            }
        }
        /*for(i=1;i<=len;i++)
        {
            for(j=1;j<=len;j++)
            {
                cout<<vis[i][j]<<" ";
            }
            cout<<endl;
        }*/
        f[0]=0;
        for(i=1;i<=len;i++)
            f[i]=INF;
        for(i=1;i<=len;i++)
        {
            for(j=1;j<=i;j++)
            {
                if(vis[j][i])
                    f[i]=min(f[i],f[j-1]+1);
            }
        }
        cout<<f[len]<<endl;


    }
    return 0;
}