hdoj 1513 Palindrome 【LCS】+【滚动数组】
2014-12-07 20:17
246 查看
Palindrome
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3265 Accepted Submission(s): 1130
Problem 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
策略: RT
代码:
#include <cstdio> #include <cstring> #include <algorithm> const int M = 5050; using namespace std; int dp[2][M]; char a[M], b[M]; int n; int main(){ while(scanf("%d", &n) == 1){ scanf("%s", a); int i, j; for(i = n-1; i >= 0; i --) b[n-1-i] = a[i]; memset(dp, 0, sizeof(dp)); for(i = 1; i <= n; i ++){ for(j = 1; j <= n; j ++){ if(a[i-1] == b[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] ); } return 0; }
相关文章推荐
- hdoj-1513-Palindrome【LCS+滚动数组】
- HDOJ题目1513 Palindrome(LCS,滚动数组)
- hdoj 1513 Palindrome【LCS+滚动数组】
- hdoj 1513 Palindrome 【LCS 滚动数组实现】
- hdoj 1513 Palindrome 【LCS】【滚动数组】
- hdoj 1513 Palindrome 【LCS】+【滚动数组】
- Hdu 1513 Palindrome【思维+Lcs+滚动数组】
- HDU 1513 Palindrome(LCS+滚动数组)
- HDU1513 Palindrome(LCS+滚动数组)
- 杭电1513_Palindrome——java(LCS+滚动数组)
- HDU-1513 Palindrome LCS+滚动数组
- hdu 1513 Palindrome【LCS滚动数组】
- HDU-1513 Palindrome LCS+滚动数组
- hdu_1513_Palindrome(LCS+滚动数组)
- 【HDU】-1513-Palindrome(LCS,模板+滚动数组)
- hdu 1513 Palindrome【LCS滚动数组】
- hdu_1513_Palindrome(LCS+滚动数组)
- 杭电-1513Palindrome(LCS+滚动数组)
- HDU 1513 Palindrome(LCS+滚动数组)
- HDU 1513 Palindrome【LCS+滚动数组】