【poj 1159】 Palindrome DP(类最长公共子序列)+滚动数组
来源:互联网 发布:淘宝男士高领衫 编辑:程序博客网 时间:2024/06/09 15:40
Palindrome
Time Limit: 3000MS Memory Limit: 65536K
Total Submissions: 58492 Accepted: 20318
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
Source
IOI 2000
题目链接:http://poj.org/problem?id=1159;
题意:求一个序列改造构成回文串最小步数;
思路:计算串与其逆串类最长公共子序列; ans=len-maxcom
*因为500*5000,dp[i][j]只与dp[i-1][]有关用滚动数组优化
代码:
#include<iostream>#include<stdio.h>#include<string.h>using namespace std;int n;char s1[5005];char s2[5005];int dp[2][5005];int main(){ scanf("%d",&n); scanf("%s",s1+1); for(int i=1;i<=n;i++) s2[i]=s1[n-i+1]; for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) { if(s1[i]==s2[j]) 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]);}
- 【poj 1159】 Palindrome DP(类最长公共子序列)+滚动数组
- poj 1159 Palindrome(最长公共子序列 + 滚动数组)
- poj 1159 Palindrome 最长公共子序列 滚动数组
- POJ 1159 Palindrome(区间DP/最长公共子序列+滚动数组)
- poj1159 Palindrome(最长公共子序列, dp+滚动数组)
- POJ--1159:Palindrome (DP求最长公共子序列)
- POJ 1159 Palindrome(最长回文子序列+滚动数组)
- poj 1159 Palindrome(最长公共子序列)
- poj 1159 Palindrome 最长公共子序列
- POJ 1159:Palindrome 最长公共子序列
- POJ - 1159 Palindrome 最长公共子序列
- poj 1159 最长公共子序列+滚动数组
- poj1159--Palindrome(dp:最长公共子序列变形 + 滚动数组)
- poj1159 Palindrome 最长公共子序列 + 滚动数组
- 回文 Palindrome 最长公共子序列 滚动数组
- (POJ 1159)Palindrome <最长公共子序列 / 滚动数组优化 / 记忆化搜索> 简单回文数
- HDU 1513 Palindrome(dp最大公共子序列+滚动数组)
- 最长公共子序列(DP + 滚动数组)
- ios swift 归档解档遇到的坑 3-30
- ubuntu 15.04 通过3306端口远程连接mysql
- C++组合应用之strtok字符串分割、数组平分算法、动态数组函数传参
- android手机安全性测试手段
- PCL系列——从深度图像(RangeImage)中提取NARF关键点
- 【poj 1159】 Palindrome DP(类最长公共子序列)+滚动数组
- virutalbox 无线网卡桥接
- linux爱好者博客
- 关于安卓异步加载Asynctask的学习笔记
- Codeforces--368C--Sereja and Algorithm(规律)
- easyui-datagrid 编辑单元格
- Java程序员必须掌握的8大排序算法
- 第5周项目3:时间类(1)
- java GC、新生代、老年代