Common Subsequence
Problem 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.
The program input is from a text file. Each data set in the file contains two strings representing the given sequences. The sequences are separated by any number of white spaces. The input data are correct. 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.
The program input is from a text file. Each data set in the file contains two strings representing the given sequences. The sequences are separated by any number of white spaces. The input data are correct. 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>
using namespace std; #include <string> #define maxl 2005 void LCSLength(char *x, char *y, int m, int n, int c[][maxl], int b[][maxl]) { int i, j; for(i=0;i<=m;i++) c[i][0]=0; for(j=1;j<=n;j++) c[0][j]=0; for(i=1;i<=m;i++) { for(j = 1; j <= n; j++) { if(x[i-1] == y[j-1]) { c[i][j] = c[i-1][j-1] + 1; b[i][j] = 0; //左上 } else if(c[i-1][j] >= c[i][j-1]) { c[i][j] = c[i-1][j]; b[i][j] = 1; //从上取数 } else { c[i][j] = c[i][j-1]; b[i][j] = -1; //从左取数 } } } } char x[maxl]; char y[maxl]; int b[maxl][maxl]; //b[i][j]记录c[i][j]是通过哪一个子问题的值求得的,以决定搜索的方向 int c[maxl][maxl]; //用c[i][j]记录X[i]与Y[j] 的LCS 的长度 int main(int argc, char **argv) { int m, n; while (~scanf("%s%s",x,y)) { m = strlen(x); n = strlen(y); LCSLength(x, y, m, n, c, b); printf("%d\n",c[m][n]); } return 0; }