UVA 10405 Longest Common Subsequence

题目大意：输出最长公共子序列长度，模板题

解题策略：DP

 

/*
    UVA 10405 Longest Common Subsequence
    AC by J.Dark
    ON 2013/3/6
    Time 0.052s
*/
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define MAXN 1010
char s1[MAXN], s2[MAXN];
//定义为局部数组，好像会wa 
int dp[MAXN][MAXN];

int max( int a, int b)
{
    return a > b ? a : b;
}

int main()
{
    while( gets(s1 + 1) != NULL)
    {
        gets( s2 + 1);
        int len1 = strlen(s1 + 1);
        int len2 = strlen(s2 + 1);
        memset( dp, 0, sizeof dp);
        for( int i = 1; i <= len1; i ++){
            for( int j = 1; j <= len2; j ++)
            {
                if( s1[i] == s2[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]);
    }
    return 0;
}