Common Subsequence POJ - 1458
2018-01-26 10:20
253 查看
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, x ij = 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
increasing sequence < i1, i2, ..., ik > of indices of X such that for all j = 1,2,...,k, x ij = 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
#include <iostream> #include <stdio.h> #include <string.h> #include <iostream> #include <math.h> #include <queue> #include <set> #include <algorithm> #include <stdlib.h> using namespace std; char a[1005],b[1005],c[1005],e[1005]; int d[1005][1005]; int main() { //freopen("E:\\file.txt","r",stdin); while(scanf("%s%s",&c,&e)!=EOF) { int Max=0; for(int i=1;i<=strlen(c);i++) a[i]=c[i-1]; for(int i=1;i<=strlen(e);i++) b[i]=e[i-1]; memset(d,0,sizeof(d)); for(int i=1;i<=strlen(c);i++) { for(int j=1;j<=strlen(e);j++) { if(a[i]==b[j]) { d[i][j]=d[i-1][j-1]+1; } else d[i][j]=max(d[i][j-1],d[i-1][j]); if(d[i][j]>Max) Max=d[i][j]; } } cout<<Max<<endl; } return 0; }
相关文章推荐
- POJ-1458 Common Subsequence(线性动规,最长公共子序列问题)
- POJ 1458 Common Subsequence
- POJ 1458 Common Subsequence——LCS
- POJ-1458 Common Subsequence 【LCS模板】
- POJ 1458 - Common Subsequence
- HDU 1159 & POJ 1458 Common Subsequence 【LCS】
- POJ1458--Common Subsequence(dp)
- POJ - 1458 Common Subsequence —— 最长公共子序列
- poj 1458 Common Subsequence【LCS】
- poj1458 Common Subsequence【逆序打印】
- poj1458 Common Subsequence
- Common Subsequence poj-1458 动态规划
- POJ-1458 Common Subsequence ( DP )
- POJ 1458 Common Subsequence (动规,最长公共子序列)
- POJ 1458 Common Subsequence(LCS)
- 文章标题 POJ 1458 : Common Subsequence (最长公共子序列)
- POJ 1458 Common Subsequence
- poj 1458 Common Subsequence(最长公共子序列)
- POJ 1458 Common Subsequence
- Common Subsequence POJ - 1458(dp)