UVA 10453 十七 Make Palindrome

Make Palindrome

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

Submit Status Practice UVA 10453

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

char str[1005];
int dp[1005][1005],react[1005][1005];

int dfs(int x,int y)
{
    if(x>y)
        return 0;
    if(x==y)
        printf("%c",str[x]);
    else if(react[x][y]==0)
    {
        printf("%c",str[x]);
        dfs(x+1,y-1);
        printf("%c",str[y]);
    }
    else if(react[x][y]==1)
    {
        printf("%c",str[y]);
        dfs(x,y-1);
        printf("%C",str[y]);
    }
    else if(react[x][y]==2)
    {
        printf("%c",str[x]);
        dfs(x+1,y);
        printf("%c",str[x]);
    }
    return 0;
}

int main()
{    
    int n;
    int i,j,k;
    while(scanf("%s",str)!=EOF)
    {
        memset(dp,0,sizeof(dp));
        memset(react,0,sizeof(react));

        n=strlen(str);
        for(i=n-1;i>=0;i--)
        {
            for(j=i+1;j<n;j++)
            {
                if(str[i]==str[j])
                {
                    dp[i][j]=dp[i+1][j-1];
                }
                else
                {
                    if(dp[i+1][j]>dp[i][j-1])
                    {
                        dp[i][j]=dp[i][j-1]+1;
                        react[i][j]=1;
                    }
                    else
                    {
                        dp[i][j]=dp[i+1][j]+1;
                        react[i][j]=2;
                    }
                }
            }
        }

        printf("%d ",dp[0][n-1]);
        dfs(0,n-1);
        printf("
");
    }
    return 0;
}