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<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int main()
{
int n;
while(~scanf("%d",&n))
{
char s1[6500],s2[6500];
getchar();
gets(s1);
int i,j,k;
for(i=n-1;i>=0;i--)
s2[n-i-1]=s1[i];
s2[n]=0;
int dp[2][6000]={0};
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
if(s1[i-1]==s2[j-1])
dp[i%2][j]=dp[(i-1)%2][j-1]+1;
else
dp[i%2][j]=max(dp[(i-1)%2][j],dp[i%2][j-1]);
}
}
printf("%d\n",n-dp[n%2][n]);
}
return 0;
}