uva 10192 Vacation（动态规划：LCS）

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define MAXN 110
using namespace std;

int dp[MAXN][MAXN];
char str1[MAXN], str2[MAXN];

int main(void) {
int t = 1;
while(cin.getline(str1, 105) && str1[0] != '#') {
cin.getline(str2, 105);
memset(dp, 0, sizeof(dp));
int len1 = strlen(str1);
int len2 = strlen(str2);
for(int i=0; i<len1; ++i) {
for(int j=0; j<len2; ++j) {
if(str1[i] == str2[j]) {
dp[i+1][j+1] = max(dp[i+1][j+1], dp[i][j]+1);
} else dp[i+1][j+1] = max(dp[i+1][j], dp[i][j+1]);
}
}
printf("Case #%d: you can visit at most %d cities.\n", t++, dp[len1][len2]);
}
return 0;
}