HDU 1159 Common Subsequence【LCS】

最长公共序列

#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <iostream>
#include <algorithm>
using namespace std;
#define ll long long
#define clr( a , x ) memset ( a , x , sizeof (a) );
#define RE freopen("1.in","r",stdin);
#define WE freopen("1.out","w",stdout);
#define SpeedUp std::cout.sync_with_stdio(false);
#define debug(x) cout << "Line " << __LINE__ << ": " << #x << " = " << x << endl;

const int maxn = 505;

//http://acm.hdu.edu.cn/showproblem.php?pid=1159
int lcs_str(char* s1, char* s2) {
    int lenA = strlen(s1);
    int lenB = strlen(s2);

    int dp[maxn][maxn];
    memset(dp, 0, sizeof(dp));
    for (int i = 1; i <= lenA; ++i) {
        for (int j = 1; j <= lenB; ++j) {
            if (s1[i - 1] == s2[j - 1]) {   // i - 1
                dp[i][j] = dp[i - 1][j - 1] + 1;
            } else {
                dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]) ;
            }
        }
    }
    return dp[lenA][lenB];
}

int lcs(int *arr1, int n, int *arr2, int m) {
    int dp[maxn][maxn];
    memset(dp, 0, sizeof(dp));
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= m; ++j) {
            if (arr1[i - 1] == arr2[j - 1]) {
                dp[i][j] = dp[i - 1][j - 1] + 1;
            } else {
                dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]) ;
            }
        }
    }
    return dp[n][m];
}

int main() {
    // RE
    char s1[maxn],s2[maxn];
    while ( scanf("%s%s", s1,s2) != EOF) {
        printf("%d\n", lcs_str(s1,s2));
    }
    return 0;
}