线性dp_acwing

题目：最长公共子序列

897. 最长公共子序列 - AcWing题库

分析

代码 

#include<bits/stdc++.h>
using namespace std;int n, m;
const int N = 1e3+10;
char a[N], b[N];
int dp[N][N];int main() {cin >> n >> m >> a+1 >> b+1;for(int i = 1; i <= n; i ++) {for(int j = 1; j <= m; j ++) {dp[i][j] = max(dp[i-1][j],dp[i][j-1]);if(a[i]==b[j]) dp[i][j] = max(dp[i][j], dp[i-1][j-1]+1);}}cout << dp[n][m] << endl;return 0;
}