中题解

#include<bits/stdc++.h>
using namespace std;
char x[1005],y[1005];
int dp[1005][1005];
int main(){
	cin>>x+1>>y+1;
	int l1=strlen(x+1),l2=strlen(y+1);

	for(int i=1;i<=l1;i++){
		for(int j=1;j<=l2;j++){
			dp[i][j]=0;
			if(x[i]==y[j])dp[i][j]=dp[i-1][j-1]+1;
			else dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
		}
	}
	cout<<dp[l1][l2];
	return 0; 
}