题目描述
分析:
算法1
$O(n * m)$
C++ 代码
#include<iostream>
using namespace std;
const int N = 1010;
char A[N], B[N];
int f[N][N];
int main()
{
int n, m;
cin >> n >> m;
cin >> A + 1>> B + 1;
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= m; ++j)
{
f[i][j] = max(f[i - 1][j], f[i][j - 1]);
if(A[i] == B[j])
f[i][j] = f[i - 1][j - 1] + 1;
}
cout << f[n][m] <<endl;
return 0;
}