uva 10453

DP作法，還要通路復原

dp[i][j]= if(i==j) dp[i+1][j-1]

    else min{dp[i][j-1],dp[i+1][j]}+1

//
//        GGGGGGGGGGGGG        CCCCCCCCCCCCC               AAA
//     GGG::::::::::::G     CCC::::::::::::C              A:::A
//   GG:::::::::::::::G   CC:::::::::::::::C             A:::::A
//  G:::::GGGGGGGG::::G  C:::::CCCCCCCC::::C            A:::::::A
// G:::::G       GGGGGG C:::::C       CCCCCC           A:::::::::A
//G:::::G              C:::::C                        A:::::A:::::A
//G:::::G              C:::::C                       A:::::A A:::::A
//G:::::G    GGGGGGGGGGC:::::C                      A:::::A   A:::::A
//G:::::G    G::::::::GC:::::C                     A:::::A     A:::::A
//G:::::G    GGGGG::::GC:::::C                    A:::::AAAAAAAAA:::::A
//G:::::G        G::::GC:::::C                   A:::::::::::::::::::::A
// G:::::G       G::::G C:::::C       CCCCCC    A:::::AAAAAAAAAAAAA:::::A
//  G:::::GGGGGGGG::::G  C:::::CCCCCCCC::::C   A:::::A             A:::::A
//   GG:::::::::::::::G   CC:::::::::::::::C  A:::::A               A:::::A
//     GGG::::::GGG:::G     CCC::::::::::::C A:::::A                 A:::::A
//        GGGGGG   GGGG        CCCCCCCCCCCCCAAAAAAA                   AAAAAAA
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
#include <ctime>
using namespace std;
#ifdef DEBUG
#define VAR(a,b) decltype(b) a=(b)
#define debug(...) printf("DEBUG: "),printf(__VA_ARGS__)
#define gettime() end_time=clock();printf("now running time is %.7f\n",(float)(end_time - start_time)/CLOCKS_PER_SEC);
#else
#define VAR(a,b) __typeof(b) a=(b)
#define debug(...)
#define gettime()
#endif
typedef unsigned int uint;
typedef long long int Int;
typedef unsigned long long int UInt;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\n")
#define I_de(x,n)for(int i=0;i<n;i++)printf("%d ",x[i]);Pln()
#define De(x)printf(#x"%d\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\
    printf("%d ",dp[htx][hty]);}Pln();}
#define M 1005
#define PII pair<int,int>
#define PB push_back
#define oo INT_MAX
#define Set_oo 0x3f
#define FOR(a,b) for(VAR(a,(b).begin());a!=(b).end();++a)
#define eps 1e-6
#define X first
#define Y second
clock_t start_time=clock(), end_time;
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
    int tmp=min(x,y);
    return min(tmp,z);
}
int max3(int x,int y,int z){
    int tmp=max(x,y);
    return max(tmp,z);
}
char str[M];
int dp[M][M];
int past[M][M];
int n;
void print(int b,int e){
    if(b>e)return;
    if(b==e){
        putchar(str[b]);
        return;
    }
    if(str[b]==str[e]){
        putchar(str[b]);
        print(b+1,e-1);
        putchar(str[e]);
    }else if(dp[b][e]==dp[b+1][e]+1){
        putchar(str[b]);
        print(b+1,e);
        putchar(str[b]);
    }else{
        putchar(str[e]);
        print(b,e-1);
        putchar(str[e]);
    }

}
void solve(){
    Set(dp,0);
    for(int k=0;k<n;k++){
        for(int i=0;i<n;i++){
            int t=i+k;
            if(t>=n)break;
            if(str[i]==str[t]){
                if(i>=n-1||t<=0)continue;
                dp[i][t]=dp[i+1][t-1];
            }else{
                int tmp=dp[i][t-1];
                if(tmp>dp[i+1][t]){
                    tmp=dp[i+1][t];
                }
                dp[i][t]=tmp+1;
            }
        }
    }
    printf("%d ",dp[0][n-1],str);
    print(0,n-1);
    Pln();
}
int main() {
    ios_base::sync_with_stdio(0);
    while(~scanf("%s",str)){
        n=strlen(str);
        solve();
    }

















}