Uva--10066the Twin Towers +DP

is to find the longest common sub-sequence of two sequences

The code is as follows:

#include <iostream> #include <cstdio> #include <cstring>using namespace Std;int main () {    int n1,n2 , case=0;    while (scanf ("%d%d", &n1,&n2) &&n1)    {         int a[110],b[110];         int dp[110][110],i,j;         Memset (Dp,0,sizeof (DP));         for (i=1;i<=n1;i++)             scanf ("%d", &a[i]);         for (j=1;j<=n2;j++)             scanf ("%d", &b[j]);         for (i=1;i<=n1;i++) for            (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]);            }         printf ("Twin Towers #%d\n", ++case);         printf ("Number of Tiles:%d\n\n", dp[n1][n2]);    } return 0;}

Uva--10066the Twin Towers +DP