Palindrome (DP)

Description

A palindrome is a symmetrical string, that is, a string read identically from left to right as well as from right to left. You are to write a program which, given a string, determines the minimal number of characters to be inserted into the string in order to obtain a palindrome. 

As an example, by inserting 2 characters, the string "Ab3bd" can be transformed into a palindrome ("dAb3bAd" or "Adb3bdA"). However, inserting fewer than 2 characters does not produce a palindrome. 

Input

Your program is to read from standard input. The first line contains one integer: the length of the input string N, 3 <= N <= 5000. The second line contains one string with length N. The string is formed from uppercase letters from 'A' to 'Z', lowercase letters from 'a' to 'z' and digits from '0' to '9'. Uppercase and lowercase letters are to be considered distinct.

Output

Your program is to write to standard output. The first line contains one integer, which is the desired minimal number.

Sample Input

5
Ab3bd

Sample Output

2

记忆化搜索!用dp[i][j]存i~j最少需要加多少个字符后i~j变成一个回文串

分以下情况:
1.s[i]==s[j]  那显然 dp[i][j]=dp[i+1][j-1];

2.s[i]!=s[j]  那就是分别满足左边和和右边的最小值  dp[i][j]=min(dp[i+1][j]+1,dp[i][j-1]+1);

由于N的范围是5000,dp[i][j]如果是Int需要的空间是5000*5000*(int),一开始这样MLE了,后来改成了short,空间一下减少了一半,这样勉强过了,听说可以用滚动数组来节约内存,但暂时不会,改天会了再说吧!

int Dp(int i,int j)
{
    if(i>j) return dp[i][j]=0;
    if(i==j) return dp[i][j]=0;
    if(i+1==j&&s[i]==s[j]) return dp[i][j]=0;
    if(i+1==j&&s[i]!=s[j]) return dp[i][j]=1;
    if(dp[i][j]!=INF) return dp[i][j];
    else
    {
        int ans=INF;
        if(s[i]==s[j])
        {
            ans=min(ans,Dp(i+1,j-1));
        }
        else
        {
            ans=min(ans,min(Dp(i+1,j)+1,Dp(i,j-1)+1));
        }

        return dp[i][j]=ans;
    }
}