hdu 1513 Palindrome (滚动数组处理回文串)
来源:互联网 发布:项城市乡镇人口数据 编辑:程序博客网 时间:2024/04/23 18:21
Palindrome
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6433 Accepted Submission(s): 2127
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
Recommend
linle
将字符串反转存储在新的字符串中。
两个字符串求最长公共子序列。。
然后len- LCM 就是可进行的最少操作数。
因为5000^2的数组爆内存,而且每次的操作只和上一行有关所以就可以滚动数组。
具体操作看代码。
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;char M[5003];char S[5003];int dp[2][5003];int main(){ int len; while(~scanf("%d",&len)) { scanf("%s",M+1); // printf("---%s\n",M+1); for(int i=1;i<=len;i++) { S[len-i+1]=M[i]; } // printf("---%s\n",S+1); memset(dp,0,sizeof(dp)); for(int i=1;i<=len;i++) { for(int j=1;j<=len;j++) { dp[i%2][j]=max(dp[(i-1)%2][j],dp[i%2][j-1]); if(M[i]==S[j]) { dp[i%2][j]=max(dp[i%2][j],dp[(i-1)%2][j-1]+1); } } } printf("%d\n",len-dp[len%2][len]); }}
阅读全文
0 0
- hdu 1513 Palindrome (滚动数组处理回文串)
- hdu 1513 Palindrome 回文 LCS 滚动数组
- HDOJ 1513 Palindrome【回文串&&滚动数组】
- hdu 1513 滚动数组优化 回文串
- HDU:1513 Palindrome(回文字符串+最长公共子序列+滚动数组)
- hdu 1513 Palindrome【LCS滚动数组】
- 1513 hdu Palindrome 滚动数组+LCS
- HDU-1513 Palindrome LCS+滚动数组
- HDU-1513 Palindrome LCS+滚动数组
- HDU 1513 Palindrome(LCS+滚动数组)
- HDU 1513 Palindrome【LCS+滚动数组】
- HDU 1513 Palindrome(LCS+滚动数组)
- HDU-1513 Palindrome 【LCS+滚动数组】
- Hdu 1513 Palindrome【思维+Lcs+滚动数组】
- POJ 1159-Palindrome(dp_回文串+滚动数组)
- HDU 1513 Palindrome 求回文串
- HDU ACM 1513 Palindrome->动态规划(滚动数组)
- 【HDU】-1513-Palindrome(LCS,模板+滚动数组)
- 4G虚拟内存图
- numpy.tile¶
- va_list和syslog的使用
- 牛客 题库 若MyClass是一个类名,其有如下语句序列:
- 全文检索工具lucene、solr的区别以及MongoDB的全文检索
- hdu 1513 Palindrome (滚动数组处理回文串)
- K
- EDA与VHDL作业(1)
- Hibernate 级联操作cascade及inverse
- 如何在安卓上显示复杂动画
- H: Skiing
- 前端面试经
- Hibernate 基于List集合映射
- 浅析Javascript匿名函数与自执行函数