Palindrome
| Time Limit: 3000MS | Memory Limit: 65536K | |
| Total Submissions: 58168 | Accepted: 20180 |
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.
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个字符开头的字串需要插入的个数
状态转移方程：（字符串下表以1开始）
dp[i][j]=dp[i-2][j+1] 如果s[i+j-1]==s[j]
dp[i][j]=min(dp[i-1][j-1],dp[i-1][j+1])+1 如果不等
1 #include <cstring> 2 #include <algorithm> 3 #include <cstdio> 4 #include <iostream> 5 using namespace std; 6 #define Max 5001 7 short int dp[Max][Max]; 8 char s[Max]; 9 int main() 10 { 11 int len; 12 int i,j; 13 freopen("in.txt","r",stdin); 14 scanf("%d",&len); 15 scanf("%s",s); 16 memset(dp,0,sizeof(dp)); 17 for(i=2;i<=len;i++) 18 { 19 for(j=0;j<=len-i;j++) 20 { 21 22 if(s[i+j-1]==s[j]) 23 dp[i][j]=dp[i-2][j+1]; 24 else 25 dp[i][j]=min(dp[i-1][j],dp[i-1][j+1])+1; 26 } 27 } 28 printf("%d ",dp[len][0]); 29 return 0; 30 }