UVA - 10066 The Twin Towers

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int MAXN = 110;

int arr[MAXN],brr[MAXN],dp[MAXN][MAXN];

int main(){
    int x,y,t=1;
    while (scanf("%d%d",&x,&y) != EOF && x + y){
        for (int i = 0; i < x; i++)
            scanf("%d",&arr[i]);
        for (int i = 0; i < y; i++)
            scanf("%d",&brr[i]);
        memset(dp,0,sizeof(dp));
        for (int i = 1; i <= x; i++){
            for (int j = 1; j <= y; j++){
                if (arr[i-1] == brr[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("Twin Towers #%d\n",t++);
        printf("Number of Tiles : %d\n",dp[x][y]);
        printf("\n");
    }
    return 0;
}