HDU 1159 Common Subsequence

最简单最基本的

最长公共子序列的题目。

吐槽一下为何没有给数据范围。。

//#define LOCAL
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

const int maxn = 1010;
int dp[maxn][maxn];
char s1[maxn], s2[maxn];

int main(void)
{
    #ifdef LOCAL
        freopen("1159in.txt", "r", stdin);
    #endif

    while(cin >> s1 >> s2)
    {
        int len1, len2, i, j;
        len1 = strlen(s1);
        len2 = strlen(s2);
        for(i = 1; i <= len1; ++i)
            for(j = 1; j <= len2; ++j)
            {
                if(s1[i-1] == s2[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;
}