UVa 10192 - Vacation

最长公共子序列。

代码如下：

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
#define Maxn 102
int main()
{
#ifdef test
    freopen("input.txt", "r", stdin);
#endif
    int dp[Maxn][Maxn];
    int len1, len2, cct = 0;
    char str1[Maxn], str2[Maxn];
    while(gets(str1) != NULL)
    {
        if(!strcmp(str1, "#"))
            break;
        gets(str2);
        len1 = strlen(str1);
        len2 = strlen(str2);

        for(int i=0; i<Maxn; ++i)
            dp[i][0] = dp[0][i] = 0;
        for(int i=1; i<=len1; ++i)
            for(int 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][j-1], dp[i-1][j]);
                }
            }
        printf("Case #%d: you can visit at most %d cities.\n", ++cct, dp[len1][len2]);

    }
    return 0;
}