uva10066 - The Twin Towers（dp,lcs）

#include <cstdio>
#include <algorithm>
using namespace std;
#define M 105
int a[M], b[M], n1, n2, dp[M][M];
int lcm()
{
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]==b[j]) 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(scanf("%d%d",&n1,&n2),n1+n2)
{
for(int i = 1; i <= n1; i++) scanf("%d",&a[i]);
for(int i = 1; i <= n2; i++) scanf("%d",&b[i]);
printf("Twin Towers #%d\nNumber of Tiles : %d\n\n",++cas,lcm());
}
return 0;
}