Palindrome(补全回文串+最长公共子序列的应用)hdu1513+poj1159+动态规划
来源:互联网 发布:timestamp java 编辑:程序博客网 时间:2024/05/16 16:05
Palindrome
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4277 Accepted Submission(s): 1462
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.
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
链接:http://acm.hdu.edu.cn/showproblem.php?pid=1513
题意:给出一个字符串,问要将这个字符串变成回文串要添加最少几个字符
思路:先求出正反串的最长公共子序列,然后剩下的两边加上就ok了。(以最长公共子序列为中心)
这里特别注意1000以上都需要要滚动数组,应该不然会超内存的。
#include<cstring>#include<cstdio>#include<iostream>using namespace std;int map[2][5005];//利用滚动数组string str;/***题意:给出一个字符串,问要将这个字符串变成回文串要添加最少几个字符思路:先求出正反串的最长公共子序列,然后剩下的两边加上就ok了。(以最长公共子序列为中心)*/void LCS(int &len1,int &len2){ for(int i=0;i<=len1;i++) { for(int j=0;j<=len2;j++) { if(i==0||j==0) {map[i%2][j]=0; continue;} if(str[i-1]==str[len2-j]){ map[i%2][j]=map[(i-1)%2][j-1]+1;} else if(map[(i-1)%2][j]>=map[i%2][j-1]){ map[i%2][j]=map[(i-1)%2][j];} else { map[i%2][j]=map[i%2][j-1]; } } }}int main(){ int n; while(cin>>n) { cin>>str; LCS(n,n); int ans=map[n%2][n]; cout<<n-ans<<endl; } return 0;}/*5Ab3bd6Ab34bd5Abb3f*/
0 0
- Palindrome(补全回文串+最长公共子序列的应用)hdu1513+poj1159+动态规划
- HDU1513 && POJ1159 Palindrome 最长公共子序列
- 北大POJ1159 Palindrome(动态规划求最长公共子序列)
- poj1159 Palindrome 【最长回文子序列】
- poj1159 Palindrome(最长公共子序列)
- poj1159-Palindrome(最长公共子序列)
- 动态规划经典 最长公共子序列 poj1159
- POJ 1159 Palindrome(回文串,最长公共子序列)
- hdu1513 最长回文子序列
- 最长公共子序列LCS和最长回文子序列的动态规划算法
- poj1159 Palindrome 最长公共子序列 + 滚动数组
- poj1159 Palindrome(最长公共子序列, dp+滚动数组)
- POJ 1159 Palindrome(动态规划:最长回文子序列)
- Poj1159 Palindrome(动态规划DP求最大公共子序列LCS)
- 最长回文序列与最长公共子序列(动态规划)
- 动态规划 - 最长公共子序列 - 最长公共子串 - 最长不重复子串 - 最长递增子序列 - 最长回文子串
- 动态规划 - 最长公共子序列 - 最长公共子串 - 最长不重复子串 - 最长递增子序列 - 最长回文子串
- 最长公共子序列&&最长公共子串---[动态规划]
- JQUERY 滑动加载数据
- Codeforces 587B Duff in Beach
- 循环结构之while篇
- 样式操作
- Magento url 问题
- Palindrome(补全回文串+最长公共子序列的应用)hdu1513+poj1159+动态规划
- 第一次做mysql主从复制
- 序列化与反序列化
- java中url中文编码问题
- 详细整理:UITableView优化技巧
- C_malloc、calloc、realloc的区别
- 一起说一个Ta的故事
- 算法思想之穷举法
- poj 3104 Drying 【二分查找(最小化最大值)】