Palindrome

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

题解：题目的大致意思就是要求求解给定字符串需要多少步才能成为一个回文字符串：

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cstdlib>
using namespace std;

char a[5001];
short dp[5001][5001];//用int会爆内存，所以参考别的思路 改的short；
int main()
{
    int n;
    memset(dp,0,sizeof(dp));
    while(scanf("%d",&n)!=EOF)
    {
        scanf("%s",a);
        for(int i=n-2;i>=0;i--)//应该从n-2开始遍历；
            for(int j=i+1;j<n;j++)
        {
            if(a[i]==a[j])
                dp[i][j]=dp[i+1][j-1];//缩小区间；
            else
                dp[i][j]=min(dp[i+1][j],dp[i][j-1])+1;
        }
         cout<<dp[0][n-1]<<endl;
    }
    return 0;
}