poj-------Common Subsequence(poj 1458)
2013-09-08 16:09
274 查看
Common Subsequence
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
Sample Output
Source
Southeastern Europe 2003
题意:
求两个字符串的最长公共子序列(lcs)的长度。
思路:
金典问题,动态转移方程如下:
代码如下:
View Code
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 34477 | Accepted: 13631 |
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 abfcab programming contest abcd mnp
Sample Output
4 2 0
Source
Southeastern Europe 2003
题意:
求两个字符串的最长公共子序列(lcs)的长度。
思路:
金典问题,动态转移方程如下:
if(i==0||j==0) dp[i][j]=0; else if(x[i]==y[i]) dp[i][j]=dp[i-1][j-1]+1; else dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
代码如下:
#include<iostream> #include<string> #include<cmath> using namespace std; const int MAX=500; int dp[MAX][MAX]={0}; int max(int a,int b) { return a>b?a:b; } int main(int *argv,int *argc[]) { int len1,len2,i,j; string str1,str2; //有时在时间允许范围内,用cin读字符串比较方便 while(cin>>str1>>str2) { len1=str1.length(); len2=str2.length(); for(i=1;i<=len1;i++) { for(j=1;j<=len2;j++) //转移方程 { if(str1[i-1]==str2[j-1]) dp[i][j]=dp[i-1][j-1]+1; else dp[i][j]=max(dp[i-1][j],dp[i][j-1]); } } cout<<dp[len1][len2]<<endl; } return 0; }
View Code
相关文章推荐
- POJ 1458 && HDU 1159 Common Subsequence(LCS)
- poj 1458 Common Subsequence
- POJ 1458 Common Subsequence (暴力枚举)
- Common Subsequence (poj 1458) 最长公共子序列
- Poj 1458 Common Subsequence 最长非连续序列
- poj 1458 Common Subsequence (最长公共子序列)
- POJ 1458 Common Subsequence (zoj 1733 ) LCS
- POJ 1458-Common Subsequence(线性dp/LCS)
- poj 动态规划DP - 1458 Common Subsequence
- POJ 1458 Common Subsequence(LCS)
- POJ_1458_CommonSubsequence
- POJ - 1458 Common Subsequence(最长公共子序列)
- poj-1458-Common Subsequence(LCS)
- POJ 1458 Common Subsequence (DP 动态规划)
- POJ 1458 Common Subsequence-dp-(最长公共子序列模型)
- poj 1458 Common Subsequence
- POJ 1458 Common Subsequence (zoj 1733 ) LCS
- Common Subsequence POJ - 1458(dp)
- poj1458 Common Subsequence(最长公共子序列)
- POJ 1458 Common Subsequence - from lanshui_Yang