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, 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<stdio.h> #include<string.h> char s1[1010],s2[1010]; int dp[1010][1010];// 开一个dp数组用来存储最长子串的长度; int max(int a,int b) { if(a>b) return a; else return b; } //#define max(a,b) (a>b?a:b) 这样比较两个数大小比较简单 int main() { while(scanf("%s%s",&s1,&s2)!=EOF) { memset(dp,0,sizeof(dp)); int len1=strlen(s1); int len2=strlen(s2); int i,j; for(i=1;i<=len1;i++) { for(j=1;j<=len2;j++) { if(s1[i-1]==s2[j-1])//如果最后一位字符一样就+1 { dp[i][j]=dp[i-1][j-1]+1; } else dp[i][j]=max(dp[i-1][j],dp[i][j-1]);//不是的话就取最大的继续循环 } } printf("%d\n",dp[len1][len2]); } return 0; }