Palindrome(poj1159)(动态规划)
2014-12-08 23:22
288 查看
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
Sample Output
Source
IOI 2000
Time Limit: 3000MS | Memory Limit: 65536K | |
Total Submissions: 53877 | Accepted: 18610 |
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
Source
IOI 2000
/*用short类型险过。 */ #include<stdio.h> #include<string.h> #include<algorithm> using namespace std; short dp[5002][5002]; int main() { char a[5001],s[5001]; int i,j,n; scanf("%d",&n); scanf("%s",a); memset(dp,0,sizeof(dp)); for(i=0,j=n-1;i<n;i++,j--) { s[i]=a[j]; } for(i=1;i<=n;i++) { for(j=1;j<=n;j++) { if(a[i-1]==s[j-1]) dp[i][j]=dp[i-1][j-1]+1; else dp[i][j]=max(dp[i-1][j],dp[i][j-1]); } } printf("%d\n",n-dp ); return 0; }
相关文章推荐
- Cheapest Palindrome - 最小代价构造回文 动态规划
- POJ1159(Palindrome)
- poj 1159 Palindrome 动态规划的三种解法
- POJ_3280_Cheapest_Palindrome_(动态规划)
- POJ1159,Palindrome
- [ACM_动态规划] Palindrome
- poj 1159 Palindrome - 动态规划
- [动态规划]Pku1159--Palindrome
- Palindrome (动态规划) 构成回文串
- 【UVA】10739 - String to Palindrome(动态规划)
- POJ 1159 Palindrome (动态规划)
- LeetCode 之 Palindrome Partitioning II(动态规划)
- poj 1159 Palindrome -- 回文串,动态规划
- poj1159 Palindrome
- 【原】 POJ 1159 Palindrome 回文 动态规划 解题报告
- LeetCode 132 Palindrome Partitioning II (动态规划)
- poj1159 Palindrome (dp)
- poj1159 palindrome(动态规划+滚动数组)
- UVA 10739 String to Palindrome(动态规划 回文)
- hdu 1159 Palindrome(回文串) 动态规划