POJ 1458 最长公共子序列 LCS

//#pragma comment(linker, "/STACK:16777216") //for c++ Compiler
#include <stdio.h>
#include <iostream>
#include <cstring>
#include <cmath>
#include <stack>
#include <queue>
#include <vector>
#include <algorithm>
#define ll long long
#define Max(a,b) (((a) > (b)) ? (a) : (b))
#define Min(a,b) (((a) < (b)) ? (a) : (b))
#define Abs(x) (((x) > 0) ? (x) : (-(x)))

using namespace std;

const int INF  = 0x3f3f3f3f;
const int MAXN = 500;

int dp[MAXN][MAXN];

int main(){
    int i, j, t, k, n, m;
    int len1, len2;
    string str1, str2;
    while(cin >> str1 >> str2){
        memset(dp, 0, sizeof(dp));
        len1 = str1.length();
        len2 = str2.length();
        for(i = 1; i <= len1; ++i){
            for(j = 1; j <= len2; ++j){
                if(str1[i - 1] == str2[j - 1]){
                    dp[i][j] = dp[i - 1][j - 1] + 1;
                }
                else{
                    dp[i][j] = Max(dp[i - 1][j], dp[i][j - 1]);
                }
            }
        }
        cout << dp[len1][len2] << endl;
    }
    return 0;
}