UVa 10066 - The Twin Towers

实际上就是一个纯的最长公共子序列。

代码如下：

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int main()
{
#ifdef test
    freopen("input.txt", "r", stdin);
#endif
    int n1, n2, cct = 0;
    int tower_1[102], tower_2[102], dp[102][102];
    while(scanf("%d%d", &n1, &n2) != EOF)
    {
        if(n1==0 && n2==0)
            break;
        for(int i=0; i<n1; ++i)
            scanf("%d", &tower_1[i]);
        for(int i=0; i<n2; ++i)
            scanf("%d", &tower_2[i]);

        for(int i=0; i<102; ++i)
            dp[i][0] = dp[0][i] = 0;

        for(int i=1; i<=n1; ++i)
            for(int j=1; j<=n2; ++j)
            {
                if(tower_1[i-1] == tower_2[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", ++cct);
        printf("Number of Tiles : %d\n\n", dp[n1][n2]);
    }
    return 0;
}