UVA 10192 - Vacation（最长公共子序列）

题意：
和之前的uva10405一模一样
代码：

#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;const int N = 105;int dp[N][N];char A[N], B[N];int main() {    int cas = 0;    while (gets(A) && A[0] != '#') {        gets(B);        int la = strlen(A), lb = strlen(B);        memset(dp, 0, sizeof(dp));        for (int i = 1; i <= la; i++) {            for (int j = 1; j <= lb; 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("Case #%d: you can visit at most %d cities.\n", ++cas, dp[la][lb]);    }    return 0;}