Coincidence（LCS最长公共子序列）

Find a longest common subsequence of two strings.

First and second line of each input case contain two strings of lowercase character a…z. There are no spaces before, inside or after the strings. Lengths of strings do not exceed 100.

For each case, output k – the length of a longest common subsequence in one line.

abcd
cxbydz

2

#include<cstdio>
#include<cstring>
using namespace std;int max(int a,int b)
{return a>b?a:b;
}
int main()
{int dp[101][101];int len1,len2,i,j;char s[100],ss[100];while(~scanf("%s%s",s,ss)){len1=strlen(s);len2=strlen(ss);for(i=0;i<len1;++i) dp[0][i]=0;for(j=1;j<len2;++j) dp[j][0]=0;for(i=1;i<=len1;++i)for(j=1;j<=len2;++j)if(s[i-1]!=ss[j-1]) dp[i][j]=max(dp[i][j-1],dp[i-1][j]);else dp[i][j]=dp[i-1][j-1]+1;printf("%d\n",dp[len1][len2]);}return 0;
}
/**************************************************************Problem: 1042User: 3011216016Language: C++Result: AcceptedTime:0 msMemory:1020 kb
****************************************************************/