POJ1458 Common Subsequence

题目链接：http://poj.org/problem?id=1458

分析：最大公共子序列模板

#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<cstring>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<numeric>
#include<cmath>
#include<queue>
#include<vector>
#include<set>
#include<cctype>
const double PI = acos(-1.0);
const int INF = 0x3f3f3f3f;
const int NINF = -INF - 1;
const int maxn = 1e3 + 5;
typedef long long ll;
#define MOD 1000000007
using namespace std;
char a[maxn], b[maxn];
int dp[maxn][maxn];
int main()
{
    while (scanf("%s", &a) != EOF)
    {
        scanf("%s", &b);
        memset(dp, 0, sizeof(dp));
        int len1 = strlen(a);
        int len2 = strlen(b);
        for (int i = 1; i <= len1; ++i)
        {
            for (int j = 1; j <= len2; ++j)
            {
                if (a[i - 1] == b[j - 1]) dp[i][j] = dp[i - 1][j - 1] + 1;
                else dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
            }
        }
        printf("%d
", dp[len1][len2]);
    }
    return 0;
}