Palindrome
Time Limit: 3000MS |
| Memory Limit: 65536K |
Total Submissions: 56228 |
| Accepted: 19430 |
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
同nyoj37题但本题字符串长度为5000因此直接开5000二维将会超内存因此可使用滚动数组优化为dp[2][5010];看我师父的代码将dp[5010][5010]定义为short型也可应为dp数组的值不会超过字符串长度而short型数据最大为32768而short型为2个字节比int型所占内存减少一半
#include<cstdio> #include<cstdlib> #include<cstring> using namespace std; int dp[2][5002]; char str[5002]; char s[5002]; int Max(int a,int b) { return a>b?a:b; } int main() { int i,j,n; while(scanf("%d",&n)!=EOF) { scanf("%s",str); for(i=n-1;i>=0;--i) { s[n-i-1]=str[i]; } memset(dp,0,sizeof(dp)); for(i=1;i<=n;++i) { for(j=1;j<=n;++j) { if(str[i-1]==s[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; }