POJ 1458--Common Subsequence【LCS】
2015-04-15 17:10
309 查看
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
模板题,和NYOJ36一模一样,刚学会,练练手
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 40871 | Accepted: 16525 |
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
模板题,和NYOJ36一模一样,刚学会,练练手
#include <iostream> #include <cstdio> #include <algorithm> #include <cstring> using namespace std; char s1[1100], s2[1100]; int len1, len2; int dp[1100][1100]; int LCS(){ memset(dp, 0, sizeof(dp)); int i,j; for(i = 1; i <= len1; ++i) for(j = 1; j<= len2; ++j){ if(s1[i-1] == s2[j-1]) dp[i][j] = dp[i-1][j-1] + 1; else dp[i][j] = max(dp[i-1][j], dp[i][j-1]); } return dp[len1][len2]; } int main (){ while(scanf("%s%s", s1, s2) != EOF){ len1 = strlen(s1); len2 = strlen(s2); printf("%d\n", LCS()); } return 0; }
相关文章推荐
- POJ 1458 Common Subsequence(最长公共子序列LCS)
- poj - 1458 - Common Subsequence(LCS)
- POJ:1458 Common Subsequence(LCS)
- POJ - 1458 - Common Subsequence (LCS)
- POJ 1458 Common Subsequence——LCS
- poj 1458 Common Subsequence(LCS)
- Poj 1458 Common Subsequence【LCS】【dp】
- poj 1458 Common Subsequence【LCS】
- HDU/HDOJ 1159/POJ 1458 Common Subsequence(最长公共子序列LCS,滚动数组)
- POJ 1458 Common Subsequence(LCS)
- POJ 1458 Common Subsequence(LCS)
- HDU 1159 & POJ 1458 Common Subsequence 【LCS】
- HDU1159 && POJ1458 Common Subsequence (LCS)
- poj1458--Common Subsequence--最长公共子序列LCS
- poj 1458 Common Subsequence【LCS】
- POJ 1458 Common Subsequence(LCS)
- POJ 1458 Common Subsequence (zoj 1733 ) LCS
- POJ 1458 Common Subsequence (zoj 1733 ) LCS
- 最长公共子序列(LCS, Longest Common Subsequence), POJ 1458
- POJ 1458-Common Subsequence(线性dp/LCS)