转移方程:
①C[i][j]=0 i=0 or j=0
②C[i][j]=C[i-1][j-1]+1 i!=0 and j!=0 and A[i]=B[j]
③C[i][j]=max{C[i-1][j],C[i][j-1]} i!=0 and j!=0 and A[i] != B[j]
程序:
#include<iostream>
#include<string>
#include<algorithm>
#define MAX 1001
using namespace std;
int dp[MAX][MAX]={0};
int max(int x,int y)
{
if(x>y)
return x;
return y;
}
void lcs(char a[],char b[])
{
int i,j;
int len1=strlen(a);
int len2=strlen(b);
int ans=0;
memset(dp,0,sizeof(dp));
for(i=1;i<=len1;i++)
{
for(j=1;j<=len2;j++)
{
if(a[i-1]==b[j-1])
dp[i][j]=max(dp[i][j],dp[i-1][j-1]+1);
else
dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
if(ans<dp[i][j])
ans=dp[i][j];
}
}
printf("%d\n",ans);
}
int main()
{
char a[MAX],b[MAX];
while(cin>>a>>b)
{
lcs(a,b);
}
return 0;
}