poj 1159 Palindrome
来源:互联网 发布:opencv图像分割python 编辑:程序博客网 时间:2024/05/17 08:05
Palindrome
Time Limit: 3000MS Memory Limit: 65536KTotal Submissions: 44186 Accepted: 15050
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
题意:求至少加多少个字符,使得该字符串是一个回文串
思路:回文串就是顺着读,逆着读都是一样的,先把原字符串 A 翻转 存为 B,求A,B的最长公共子序列 长度L,那么不相同的字符就是 n-L ,因为题目要求只能加字符进去,那么,有多少个不相同的就在其相对的位置加对应的字符就行了,就是说n-L就是所求解了,但是注意到的是N最大可以取5000,开一个dp[5000][5000]的数组会MLE的,所以要有个空间优化,详细见代码。
#include <iostream>#include <algorithm>#include <cstdio>#include <cstring>#include <cmath>#define maxn 5005#define loop(a,b,c) for(int a=b;a<=c;a++)#define nloop(a,b,c) for(int a=b;a>=c;a--)#define clr(a,b) memset(a,b,sizeof(a))typedef long long ll;using namespace std;char word[maxn],test[maxn];int dp[2][maxn];int main(){ int n; while(cin>>n) { int now=1; clr(dp,0); loop(i,1,n) cin>>word[i]; loop(i,1,n) test[i]=word[n-i+1]; loop(i,1,n) { loop(j,1,n) if(word[i]==test[j]) dp[now][j]=dp[!now][j-1]+1; else dp[now][j]=max(dp[!now][j],dp[now][j-1]); now=!now; } cout<<n-dp[!now][n]<<endl; } return 0;}
0 0
- poj 1159 Palindrome LCS
- poj 1159 Palindrome LCS
- poj 1159 Palindrome
- poj 1159 Palindrome
- dp poj 1159 Palindrome
- poj 1159 Palindrome
- poj 1159 Palindrome
- POJ 1159 Palindrome DP
- Palindrome poj 1159
- Poj 1159 Palindrome
- poj 1159 Palindrome
- poj 1159 Palindrome 【DP】
- poj 1159Palindrome
- poj 1159 Palindrome
- POJ 1159 Palindrome
- POJ 1159 Palindrome
- Poj 1159 Palindrome
- POJ 1159 Palindrome
- python strip lstrip rstrip用法
- iOS开发之基础视图——UITextField
- 文件系统产生
- Xshell实现对VMWare下的CentOS虚拟操作系统远程登录之正确配置方法
- 程序员们,时间少,送女友,媳妇礼物的机会来了
- poj 1159 Palindrome
- Java网络编程--TCP文件上传、图片上传示例
- 剑指offer—数值的整数次方
- “互联网+”我们工作应该是这样的
- 这是怎么回事呢?
- c++第5次实验
- 【BZOJ2594】水管局长加强版,LCT+并查集+二分查找位置
- APS.NET_MVC5学习笔记 - 添加一个模型
- Hardening the media stack