poj1458 LCS 基础dp
来源:互联网 发布:制作动漫软件 编辑:程序博客网 时间:2024/06/05 02:13
Common Subsequence
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 54939 Accepted: 22901
Description
A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = < x1, x2, ..., xm > another sequence Z = < z1, z2, ..., zk > is a subsequence of X if there exists a strictly increasing sequence < i1, i2, ..., ik > of indices of X such that for all j = 1,2,...,k, xij = zj. For example, Z = < a, b, f, c > is a subsequence of X = < a, b, c, f, b, c > with index sequence < 1, 2, 4, 6 >. Given two sequences X and Y the problem is to find the length of the maximum-length common subsequence of X and Y.
Input
The program input is from the std input. Each data set in the input contains two strings representing the given sequences. The sequences are separated by any number of white spaces. The input data are correct.
Output
For each set of data the program prints on the standard output the length of the maximum-length common subsequence from the beginning of a separate line.
Sample Input
abcfbc abfcabprogramming contest abcd mnp
Sample Output
420
Source
Southeastern Europe 2003
#include<iostream>#include<cstring>#include<string>#define max(a,b) a>b?a:busing namespace std;string a,b;int f[1005][1005];int dp(int ia,int ib){if(ia<0 || ib<0){return 0;}int &ans = f[ia][ib];if(ans>=0){return ans;}if(a[ia] == b[ib]){return ans = 1+dp(ia-1,ib-1);}else{int l1 = dp(ia-1,ib);int l2 = dp(ia,ib-1);return ans = max(l1,l2);}}int main(){while(cin>>a>>b){memset(f,-1,sizeof(f));int len1 = a.length(),len2 = b.length();cout<<dp(len1-1,len2-1)<<endl;}return 0;}
阅读全文
0 0
- poj1458 LCS 基础dp
- [dp]poj1458 -Common Subsequence(LCS)
- POJ1458 LCS
- poj1458(LCS)
- POJ1458 LCS
- poj1458 LCS
- POJ1458 Common Subsequence LCS问题入门题[DP]
- poj1458 Common Subsequence【LCS】
- 【LCS】POJ1458-Common Subsequence(模板)+LCS 的DP值算法解释
- 【LCS】POJ1458-Common Subsequence(模板)+LCS 的DP值算法解释
- poj1458 dp
- 【DP】poj1458
- HDU1159 && POJ1458:Common Subsequence(LCS)
- HDU1159 && POJ1458:Common Subsequence(LCS)
- POJ1458 动态规划 (LCS,水)
- POJ1458 && HDOJ1159 Common Subsequence【LCS】
- HDU1159 && POJ1458 Common Subsequence (LCS)
- poj1458-LCS&回溯-Common Subsequence
- opengl实现Bloom效果
- 用Python 编写Logistics算法
- 填充去噪算法
- 翻译连载 | JavaScript 轻量级函数式编程-第1章:为什么使用函数式编程?|《你不知道的JS》姊妹篇
- svn bug Description 不能接受属性“svn log”的非LF行换行符
- poj1458 LCS 基础dp
- 643
- 翻译连载 |《你不知道的JS》姊妹篇 | JavaScript 轻量级函数式编程-引言&前言
- 如何在Idea中使用svn,以及代码更新报错的问题解决
- hdu 1443 Joseph (约瑟夫环)
- The POM for 0.0.1-SNAPSHOT is missing, no dependency informat
- php non-thread-safe和thread-safe这两个版本有何区别
- 应用程序运行***buffer overflow detected*** terminated Aborted异常退出问题
- H5游戏的界面层次