POJ - 1458 Common Subsequence(最长公共子序列)

题目大意：求两个字符串的最长公共子序列

解题思路：裸题

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 1010;

char str1[N], str2[N];
int dp[N][N];

void solve() {
    memset(dp, 0, sizeof(dp));
    int len1 = strlen(str1 + 1);
    int len2 = strlen(str2 + 1);

    for (int i = 1; i <= len1; i++)
        for (int j = 1; j <= len2; j++) {
            if (str1[i] == str2[j]) dp[i][j] = dp[i - 1][j - 1] + 1;
            else  dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
        }
    printf("%d\n", dp[len1][len2]);
}

int main() {
    while (scanf("%s%s", str1 + 1, str2 + 1) != EOF) solve();
    return 0;
}