hdoj 1513 Palindrome 【LCS】【滚动数组】
来源:互联网 发布:字体管家mac版 编辑:程序博客网 时间:2024/05/01 15:02
Palindrome
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4086 Accepted Submission(s): 1393
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思路: 给你一个由n个字符组成的字符串,问最少再增加多少个字符就可以让其成为一个回文字符串,这道题用滚动数组做,因为dp[5000][5000]太大,超内存。求出原字符串的反转字符串,再求这两个字符串的最长公共子序列,最后用长度n减去最长公共子序列的长度即可。dp[i]可写成dp[i%2],dp[i-1]可写成dp[(i-1)%2].代码:#include<stdio.h>#include<string.h>#define max(a,b) (a>b?a:b)int dp[2][5100];char s1[5100],s2[5100];int main(){int n,i,j;while(scanf("%d",&n)!=EOF){scanf("%s",s1);strcpy(s2,s1); //字符串复制; strrev(s2); //字符串反转; memset(dp,0,sizeof(dp));for(i=1;i<=n;i++){for(j=1;j<=n;j++){if(s1[i-1]==s2[j-1]){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]);}return 0;}
0 0
- hdoj 1513 Palindrome 【LCS】+【滚动数组】
- hdoj 1513 Palindrome 【LCS】+【滚动数组】
- hdoj 1513 Palindrome 【LCS 滚动数组实现】
- hdoj 1513 Palindrome 【LCS】【滚动数组】
- HDOJ 1513 Palindrome(LCS+滚动数组)
- hdoj-1513-Palindrome【LCS+滚动数组】
- HDOJ题目1513 Palindrome(LCS,滚动数组)
- HDOJ 1513 LCS + 滚动数组
- hdu 1513 Palindrome 回文 LCS 滚动数组
- 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+滚动数组】
- C#编程:对象序列化为字节数组以及字节数组反序列化为对象
- 反射机制(一)
- Mapper与Reducer浅析(一)
- CLRS 5.1雇佣问题
- 国外网站淘来的invocie java代码
- hdoj 1513 Palindrome 【LCS】【滚动数组】
- bitmap
- 考试
- C#里怎样把一个DataTable的数据追加进数据库里的某个表
- js中的简单排序
- 【算法笔记】Aho-Corasick 算法(AC自动机) 小结
- Android 编程下的 EditView 阻止软键盘自动弹出__图片资源文件后缀不能为.ico
- 约瑟夫环问题 循环链表
- MapReduce的处理流程(一)