uva10192 - Vacation(dp,lcs)

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define M 105
char a[M], b[M];
int n1, n2, dp[M][M];
int lcm()
{
n1 = strlen(a); n2 = strlen(b);
for(int i = 0; i <= n1; i++) dp[i][0] = 0;
for(int i = 0; i <= n2; i++) dp[0][i] = 0;
for(int i = 1; i <= n1; i++)
for(int j = 1; j <= n2; 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]);
}
return dp[n1][n2];
}
int main ()
{
int cas = 0;
while(gets(a))
{
if(a[0]=='#') break;
gets(b);
printf("Case #%d: you can visit at most %d cities.\n",++cas,lcm());
}
return 0;
}