大意:
最长公共子序列,如果相同那么dp[i][j] = dp[i-1][j-1] + 1,否则就取max(dp[i][j-1],dp[i-1][j])
#include <iostream>
# include<cstdio># include<cstring>
using namespace std;
int max(int a,int b)
{
return a>b ?a : b;
}
char s1[1005],s2[1005];
int dp[1005][1005];
int main()
{
int i,j,len1,len2;
while(scanf("%s%s",s1,s2)!=EOF)
{
len1 = strlen(s1);
len2 = strlen(s2);
int ans=0;
dp[0][0] = 0;
for(i=1; i<=len1; i++)
dp[i][0] = 0;
for(j=1; j<=len2; j++)
dp[0][j] = 0;
for(i=1; i<=len1; i++)
{
for(j=1; j<=len2; j++)
{
if(s1[i-1]==s2[j-1])
dp[i][j] = max(max(dp[i-1][j],dp[i][j-1]),dp[i-1][j-1]+1);
else
dp[i][j] = max(dp[i-1][j],dp[i][j-1]);
if(dp[i][j]>ans)
ans= dp[i][j];
}
}
printf("%d\n",ans);
}
return 0;
}