POJ1159:Palindrome(LCS)
来源:互联网 发布:重大资产重组知乎 编辑:程序博客网 时间:2024/05/16 10:06
Palindrome
Time Limit: 3000MS Memory Limit: 65536KTotal Submissions: 62132 Accepted: 21652
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
5Ab3bd
Sample Output
2
Source
IOI 2000
题意:给一个字符串,求最少添加几个字符使其变成回文串。思路:将字符串倒置形成新的字符串,求两者的最长公共子序列ans,字符串长度-ans即为答案。
# include <iostream># include <cstdio># include <cstring># include <algorithm># define MAXN 5000using namespace std;int main(){ int dp[2][MAXN+1], len;//dp数组压缩内存。 char a[MAXN+3], b[MAXN+3]; while(~scanf("%d",&len)) { scanf("%s",a+1); memset(dp, 0, sizeof(dp)); for(int i=1; i<=len; ++i) b[i] = a[len-i+1]; int t=1; for(int i=1; i<=len; ++i) { t = 1-t; for(int j=1; j<=len; ++j) { if(a[i]==b[j]) dp[t][j] = dp[1-t][j-1] + 1; else dp[t][j] = max(dp[t][j-1], dp[1-t][j]); } } printf("%d\n",len-dp[t][len]); } return 0;}
0 0
- POJ1159:Palindrome(LCS)
- POJ1159---Palindrome(dp,LCS)
- POJ1159 Palindrome LCS
- HDU1513 && POJ1159:Palindrome(LCS)
- poj1159 Palindrome DP,lcs
- Palindrome POJ1159 LCS+滚动数组
- POJ1159(Palindrome)
- poj1159 LCS
- poj1159 【LCS】
- POJ1159:Palindrome(回文数)
- poj1159(Palindrome+回文串)
- POJ1159 Palindrome (动态规划)
- Palindrome 简单(dp)poj1159
- POJ1159 Palindrome
- poj1159 - Palindrome
- POJ1159 Palindrome
- POJ1159--Palindrome
- POJ1159 Palindrome
- ajax的使用
- msconfig打不开,运行找不到msconfig解决办法
- 实现一个简单的 页面划入效果
- 关键字static的用法
- ==和equals()区别
- POJ1159:Palindrome(LCS)
- Qt C++的函数不定参数
- JAVA报表神器DynamicReports
- python CGI环境搭建
- Centos 7.0 execute yum update ——File "/usr/libexec/urlgrabber-ext-down", line 75, in <module>
- 如何在QT中给程序添加图标
- Median of Two Sorted Arrays (第二周:分治法)
- sql开发笔记
- leetcode之insertion-sort-list