c_cpp 最长的共同子序列

Posted 2021-05-14

#include <iostream>
#include <string>
#include <algorithm>
using namespace std;

const int N = 100;
char A[N], B[N];
int dp[N][N];

int main() {
	int n;
	cin >> A + 1;	// Start from index 1
	cin >> B + 1;
	int lenA = strlen(A + 1);
	int lenB = strlen(B + 1);
	// boundary
	for (int i = 0; i <= lenA; i++) {
		dp[i][0] = 0;
	}
	for (int j = 0; j <= lenB; j++) {
		dp[0][j] = 0;
	}
	// state transition equation
	for (int i = 1; i <= lenA; i++) {
		for (int j = 1; j <= lenB; 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[lenA][lenB] << endl;
	return 0;
}

/*
Sample Input：
sadstory
adminsorry
Sample Output:
6
*/