UVa 10066 - The Twin Towers

/**
@author - Rumman BUET CSE'15
Problem - UVa 10066 The Twin Towers

Concept - LCS , DP

Easy one. Just understand if LCS can be applied for bricks, it can be applied for bricks too. :3
*/

#include <bits/stdc++.h>
#include<vector>
#define ll                                      long long int
#define fi                                      freopen("in.txt", "r", stdin)
#define fo                                      freopen("out.txt", "w", stdout)
#define m0(a) memset(a , 0 , sizeof(a))
#define m1(a) memset(a , -1 , sizeof(a))

#define mx 150000
using namespace std;

int s1[110] , s2[110] ;
int dp[110][110] ;
int l1 , l2 ;

void lcs()
{
    for(int i = 0 ; i < 110 ; i++)
    {
        dp[i][0] = 0 ;
        dp[0][i] = 0 ;
    }
    for(int i = 1 ; i <= l1 ; i++)
    {
        for(int j = 1 ; j <= l2 ; j++)
        {
            if(s1[i-1] == s2[j-1])
            {
                dp[i][j] = dp[i-1][j-1] + 1 ;
            }
            else if(dp[i-1][j] > dp[i][j-1])
            {
                dp[i][j] = dp[i-1][j] ;
            }
            else if(dp[i-1][j] <= dp[i][j-1])
            {
                dp[i][j] = dp[i][j-1] ;
            }
        }
    }
}

int main()
{
//    fi ;
//    fo ;
    int t = 0 ;
    while(scanf("%d %d",&l1 , &l2) && l1 && l2)
    {
        t++ ;
        for(int i = 0 ; i < l1 ; i++)
        {
            scanf("%d",&s1[i]) ;
        }
        for(int j = 0 ; j < l2 ; j++)
        {
            scanf("%d",&s2[j]) ;
        }
        lcs() ;
        printf("Twin Towers #%d\n" , t) ;

        printf("Number of Tiles : %d\n\n",dp[l1][l2]) ;
    }
    return 0 ;
}