编辑代码

#include<bits/stdc++.h>
using namespace std;
const int maxn = 20;
int dp[maxn][maxn];
char a[maxn];
char b[maxn];
int main(){

gets(a+1);
gets(b+1);
int lena = (int)strlen(a+1);
int lenb = (int)strlen(b+1);

for(int i = 0;i<lena;i++){
    dp[i][0] = 0;
}
for(int j = 0;j<lenb;j++){
    dp[0][j] = 0;
}
for(int i = 1;i<=lena;i++){
    for(int j = 1;j<=lenb;j++){
    
        if(a[i]==b[j])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[lena][lenb]);

return 0;
}