POJ1159Palindrome(区间dp回文串最长公共子序列+滚动数组模板)
来源:互联网 发布:vlookup两张表查找数据 编辑:程序博客网 时间:2024/05/16 16:24
Palindrome
Time Limit: 3000MS Memory Limit: 65536KTotal Submissions: 62457 Accepted: 21761
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
题目大意:给一个字符串,求组成一个字符串成回文串能够最少增加几个字符
解题思路:回文串基本上就是遇到不会的状况,除非水到不行的题,这道题用到了最长公共子序列,方法就是你要把字符串从头存一个,从尾存一个,然后进行比较,在代码中,下面的代码是最重要的
if (a[i] == b[j]){dp[e][j] = dp[1 - e][j - 1] + 1;}else{dp[e][j] = max(dp[e][j - 1], dp[1 - e][j]);}
然后考虑到数据5000,开二维数组完全是不可能的,所以为了能够解决问题,减少内存,运用了滚动数组的概念,这个概念是从网上找的,所以我就先看看,会了就补上来
#include<iostream> #include<cstdio> #include<stdio.h> #include<cstring> #include<cstdio> #include<climits> #include<cmath> #include<vector> #include <bitset> #include<algorithm> #include <queue> #include<map> using namespace std;int dp[5][5005], i, n, e, j;char a[5005], b[5005];int main(){cin >> n;for (i = 1; i <= n; i++){cin >> a[i];b[n - i + 1] = a[i];}memset(dp, 0, sizeof(dp));e = 0;for (i = 1; i <= n; i++){e = 1 - e;for (j =1; j <= n; j++){if (a[i] == b[j]){dp[e][j] = dp[1 - e][j - 1] + 1;}else{dp[e][j] = max(dp[e][j - 1], dp[1 - e][j]);}}}cout << n-dp[e][n] << endl;}
0 0
- POJ1159Palindrome(区间dp回文串最长公共子序列+滚动数组模板)
- poj1159Palindrome(LCS最长公共子序列变形)
- POJ 1159 Palindrome(区间DP/最长公共子序列+滚动数组)
- 回文 Palindrome 最长公共子序列 滚动数组
- poj1159 Palindrome(最长公共子序列, dp+滚动数组)
- 最长公共子序列(DP + 滚动数组)
- 【DP】 最长公共回文子序列
- 回文字符串【最长公共子序列】【DP】
- 最长回文子序列 区间dp
- hdu1513Palindrome【最长公共子序列&滚动数组】
- 最长回文子串、回文子序列、公共子序列
- 最长公共子串、最长公共子序列、最长递增子序列、最长回文子串
- HDU:1513 Palindrome(回文字符串+最长公共子序列+滚动数组)
- 最长公共子串、最长公共子序列、最长回文子串、最长回文子序列、回文子串个数
- 最长公共回文子序列
- 最长公共子序列与最长公共子串(DP)
- 最长公共子序列与最长公共子串(DP)
- 最长回文子序列+最长公共子序列+最长连续回文子串
- Lucene初探之索引过程分析(二)
- 面向对象的js(1)
- 3. Java NIO系列之Channel的获取
- LeetCode 461. Hamming Distance
- Hadoop rpc demo
- POJ1159Palindrome(区间dp回文串最长公共子序列+滚动数组模板)
- 全栈工程师
- Kali-WIFI攻防(一)----无线网络嗅探工具Kismet
- poj3273:Monthly Expense——题解
- 数据库三大范式理解
- Oracle 监听处理脚本
- C++ 关于缺省参数的静态绑定
- eclipse中配置Tomcat并启动服务器发布项目
- 详解Hibernate Session & Transaction