UVA 11584 一 Partitioning by Palindromes

Partitioning by Palindromes

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

Submit Status Practice UVA 11584

 

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

char a[1005];

int C(int x,int y)
{
    int flg=1;
    while(x<y)
    {
        if(a[x]!=a[y])
        {
            flg=0;
            break;
        }
        x++,y--;
    }
    return flg;
}

int main()
{
    int T;
    int dp[1005];
    scanf("%d",&T);
    while(T--)
    {
        int n,i,j;
        scanf("%s",a);
        memset(dp,0,sizeof(dp));
        n=strlen(a);
        dp[0]=1;
        for(i=1;i<n;i++)
        {
            dp[i]=dp[i-1]+1;
            for(j=i-1;j>0;j--)
            {
                if(C(j,i))
                {
                    dp[i]=min(dp[i],dp[j-1]+1);
                }
            }
            if(C(0,i))
                dp[i]=1;
        }
        /*for(i=0;i<n;i++)
            printf("%d ",dp[i]);
        printf("
");*/
        printf("%d
",dp[n-1]);
    }
    return 0;
}