Palindrome
Time Limit: 3000MS Memory Limit: 65536K
Total Submissions: 62538 Accepted: 21797
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 <stdio.h>
#include <string.h>
#define max(a,b) a>b?a:b
int dp[2][5005];//滚动数组
//d[i][j]表示第i个字符为首,第j个字符为尾 需要添加的最少字符个数
int main()
{
int n;
int i,j,k;
char s1[5005],s2[5005];//s2是s1的逆序列
scanf("%d",&n);
getchar();
scanf("%s",s1+1);
getchar();
memset(dp,0,sizeof(dp));
for(i=1,j=n;i<=n,j>=0;i++,j--)
{
s2[i]=s1[j];
}
int max=0;
//最长公共子序列
for(i=1;i<=n;i++){
for(j=1;j<=n;j++)
{
if(s1[i]==s2[j]){
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]);
if(max<dp[i%2][j]) max=dp[i%2][j];
}
}
printf("%d\n",n-max);
return 0;
}