Light OJ 1033 .5THproblem A. DP 最长回文子序列

Description

By definition palindrome is a string which is not changed when reversed. "MADAM" is a nice example of palindrome. It is an easy job to test whether a given string is a palindrome or not. But it may not be so easy to generate a palindrome.

Here we will make a palindrome generator which will take an input string and return a palindrome. You can easily verify that for a string of length n, no more than (n - 1) characters are required to make it a palindrome. Consider "abcd" and its palindrome "abcdcba" or "abc" and its palindrome "abcba". But life is not so easy for programmers!! We always want optimal cost. And you have to find the minimum number of characters required to make a given string to a palindrome if you are only allowed to insert characters at any position of the string.

Input

Input starts with an integer T (≤ 200), denoting the number of test cases.

Each case contains a string of lowercase letters denoting the string for which we want to generate a palindrome. You may safely assume that the length of the string will be positive and no more than 100.

Output

For each case, print the case number and the minimum number of characters required to make string to a palindrome.

Sample Input

6

abcd

aaaa

abc

aab

abababaabababa

pqrsabcdpqrs

Sample Output

Case 1: 3

Case 2: 0

Case 3: 2

Case 4: 1

Case 5: 0

Case 6: 9

 分析：

dp[i][j]表示从i到j最少要添加的字符个数

if(a[i]==a[j])
                dp[i][j]=dp[i+1][j-1];  //dp等于上一个状态的dp
            else
                dp[i][j]=min(dp[i+1][j],dp[i][j-1])+1;  //取两种划分的最小值

代码及分析如下：

//dp[i][j]表示从i到j最少要添加的字符个数
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
using namespace std;
int dp[105][105];
string a;
int min(int x,int y)
{
    if(x<=y)
        return x;
    else
        return y;
}

int main()
{
    int t,len,i,j,Case=1;
    cin>>t;
    while(t--)
    {
        cin>>a;
        len=a.size();
        memset(dp,0,sizeof(dp)); 
        for(i=len-2;i>=0;i--)    //注意i从倒数第二个位置开始
            for(j=i+1;j<=len-1;j++)  //j<=len-1而不是j<=len-2
           {
            if(a[i]==a[j])
                dp[i][j]=dp[i+1][j-1];  //dp等于上一个状态的dp
            else
                dp[i][j]=min(dp[i+1][j],dp[i][j-1])+1;  //取两种划分的最小值

           }
        printf("Case %d: %d
",Case++,dp[0][len-1]);
    }

    return 0;
}