hdoj 1513 Palindrome 【LCS】+【滚动数组】
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.
5 Ab3bd
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][n]); } return 0; }
郑重声明:本站内容如果来自互联网及其他传播媒体,其版权均属原媒体及文章作者所有。转载目的在于传递更多信息及用于网络分享,并不代表本站赞同其观点和对其真实性负责,也不构成任何其他建议。