题解 | 最长公共子序列(一)

#include<string>
#include<iostream>
#include<algorithm>
using namespace std;
const int N = 1010;
string s1, s2;
int f[N][N];
int main()
{
    int n, m;
    cin >> n >> m;
    cin >> s1>>s2;
    s1=" "+s1;
    s2=' '+s2;
     
    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 (s1[i] == s2[j])
                f[i][j] = max(f[i][j], f[i - 1][j - 1] + 1);
        }
    cout << f[n][m] << endl;
    return 0;
}