C++ 代码
#include<bits/stdc++.h>
using namespace std;
const int N = 1e3 + 10;
int f[N][N];
char a[N], b[N];
int main()
{
int n, m; cin >> n >> m;
scanf("%s%s", a + 1, b + 1);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
{
if (a[i] == b[j])f[i][j] = f[i - 1][j - 1] + 1;
else f[i][j] = max(f[i - 1][j], f[i][j - 1]);
}
cout << f[n][m];
}