uva 10192 lcs

题意：

题目：！#@￥！￥%！￥#@！#！@#￥！@#￥......

我：说人话！

题目：给俩字符串求最长公共子序列。

代码：

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <stack>
#include <vector>
#include <queue>
#include <map>

#define LL long long

using namespace std;
const int maxn = 100 + 10;
const int inf = 0x3f3f3f3f;
const double eps = 1e-8;
const double pi = 4 * atan(1.0);
const double ee = exp(1.0);

int dp[maxn][maxn];
char s1[maxn];
char s2[maxn];

int main()
{
    #ifdef LOCAL
    freopen("in.txt", "r", stdin);
    #endif // LOCAL
    int ncase = 1;
    while (gets(s1))///....gg
    {
        if (s1[0] == '#')
            break;
        gets(s2);
        memset(dp, 0, sizeof(dp));
        int len1 = strlen(s1);
        int len2 = strlen(s2);
        for (int i = 1; i <= len1; i++)
        {
            for (int j = 1; j <= len2; j++)///...JJ
            {
                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("Case #%d: you can visit at most %d cities.\n", ncase++, dp[len1][len2]);
    }
    return 0;
}