最长公共子序列

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         abfcab
programming    contest 
abcd           mnp

Sample Output

4
2
0

maxLen(i,j)表示:
s1的左边i个字符形成的子串，与s2左边的j个字符形成的子串的最长公共子序列的长度

分析：

1.当s1的第i个元素与s2的第j个元素相等时，maxlen[i][j]就等于前面最长公共子序列加上此时相等的第i个j个元素。

即：maxlen[i][j]=maxlen[i-1][j-1]+1;

2..当s1的第i个元素与s2的第j个元素不相等时，例如：abec与abcp,两者最后一个字母不相同，但此位置最大公共子序列等于abec与abc的公共序列最大长度

即： maxlen[i][j]=max(maxlen[i][j-1],maxlen[i-1][j]);

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#define m 1010
using namespace std;
int maxlen[m][m];
int main(){
   char a1[m],a2[m];
   while(cin>>a1>>a2){
        memset(maxlen,0,sizeof(int));
        int length1=strlen(a1);
        int length2=strlen(a2);
        for(int i=0;i<length1;i++){//递推出口
            maxlen[i][0]=0;
        }
        for(int j=0;j<length2;j++){
            maxlen[0][j]=0;
        }
        for(int i=1;i<=length1;i++){
            for(int j=1;j<=length2;j++){
                if(a1[i-1]==a2[j-1]){
                    maxlen[i][j]=maxlen[i-1][j-1]+1;//1
                }
                else{
                    maxlen[i][j]=max(maxlen[i][j-1],maxlen[i-1][j]);//2
                }
            }
        }
        printf("%d\n",maxlen[length1][length2]);

   }
   return 0;
}