UVA 10066 The Twin Towers LCS ,Commencel

裸的LCS不解释

#include <map>#include <set>#include <list>#include <cmath>#include<cctype>#include <ctime>#include <deque>#include <stack>#include <queue>#include <cstdio>#include <string>#include <vector>#include <cstdlib>#include <cstring>#include <iostream>#include <algorithm>#define LL long long#define PI 3.1415926535897932626using namespace std;int gcd(int a, int b){return a % b == 0 ? b : gcd(b, a % b);}#define MAXN 110int N1,N2;int tower1[MAXN],tower2[MAXN];int dp[MAXN][MAXN];int main(){    //freopen("sample.txt","r",stdin);    int kase=1;    while (scanf("%d%d",&N1,&N2)!=EOF)    {        if (N1==0 && N2==0) break;        for (int i=0;i<N1;i++)            scanf("%d",&tower1[i]);        for (int i=0;i<N2;i++)            scanf("%d",&tower2[i]);        memset(dp,0,sizeof(dp));        for (int i=1;i<=N1;i++)        {            for (int j=1;j<=N2;j++)                if (tower1[i-1]==tower2[j-1])            {                dp[i][j]=dp[i-1][j-1]+1;            }               else            {               dp[i][j]=max(dp[i][j-1],dp[i-1][j]);            }        }        printf("Twin Towers #%d\n",kase++);        printf("Number of Tiles : %d\n\n",dp[N1][N2]);    }    return 0;}