1800 最长公共子序列

#include<bits/stdc++.h>
#define ll long long
using namespace std;

int dp[1001][1001];
void init(int n, int m) {
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			dp[i][j] = 0;
		}
	}
}

int main() {
	string a, b;
	while (cin >> a >> b) {
		int n = a.size(), m = b.size();
		init(n, m);
		a = "#" + a;
		b = "#" + b;
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= m; j++) {
				if (a[i] == b[j]) {
					dp[i][j] = dp[i - 1][j - 1] + 1;
				} else {
					dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
				}
			}
		}
		cout << dp[n][m] << endl;
	}

	return 0;
}