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

#include <stdio.h>
#include <stdlib.h>

int main() {
    int n, m;
    scanf("%d %d", &n, &m);
    char* str1 = (char*)malloc((n+1) * sizeof(char));
    char* str2 = (char*)malloc((m+1) * sizeof(char));
    int dp[n + 1][m + 1];
    scanf("%s", str1);
    scanf("%s", str2);
    for (int i = 0; i <= m; i++) {
        dp[0][i] = 0;
    }
    for (int i = 0; i <= n; i++) {
        dp[i][0] = 0;
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            if (str1[i - 1] == str2[j - 1]) {
                dp[i][j] = dp[i - 1][j - 1] + 1;
            } else {
                dp[i][j] = dp[i - 1][j] > dp[i][j - 1] ? dp[i - 1][j] : dp[i][j - 1];
            }
        }
    }
    printf("%d",dp[n][m]);
    return 0;
}