uva10066 - The Twin Towers(LCS)

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

const int N = 105;
int a
, b
, dp

;

int main() {
int n, m;
int cas = 0;
while (~scanf("%d%d", &n, &m) && (n||m)) {
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int j = 1; j <= m; j++)
scanf("%d", &b[j]);
memset(dp, 0, sizeof(dp));
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; 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]);
}
}
printf("Twin Towers #%d\nNumber of Tiles : %d\n\n", ++cas, dp
[m]);
}
return 0;
}