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

#include <bits/stdc++.h>
using namespace std;
const int N = 1005;
int dp[N][N] = {0};
int n,m;
string s1, s2;
int main() {
    cin >> n >> m;
    cin >> s1 >> s2;
    for(int i = 0;i<n;i++) {
        for(int j = 0;j<m;j++) {
            if (s1[i] == s2[j]) {
                dp[i+1][j+1] = dp[i][j] + 1;
            } else {
                dp[i+1][j+1] = max(dp[i+1][j],dp[i][j+1]);
            }
        }
        
    }
    cout << dp[n][m] << endl;
    return 0;
}
// 64 位输出请用 printf("%lld")