UVa 10066 - The Twin Towers

题目说的很麻烦，就是求已给出的两组数列的最长公共子序列

 

#include <iostream>
#include <cstdio>
#include <algorithm>

using namespace std;

int Case, n, m, a[105], b[105], dp[105][105];

int LCS ( int a[], int b[] ) {
    dp[0][0] = 0;
    for ( int i = 1; i <= m; dp[i][0] = 0, ++i ) ;
    for ( int i = 1; i <= n; dp[0][i] = 0, ++i ) ;
    for ( int i = 1; i <= m; ++i )
        for ( int j = 1; j <= n; ++j ) {
            if ( a[i - 1] == b[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 dp[i][j] = dp[i][j - 1];
    }
    return dp[m][n];
}

int main ( ) {
    Case = 1;
    while ( scanf ( "%d%d", &m, &n ) != EOF && n && m ) {
        for ( int i = 0; i < m; scanf ( "%d", &a[i] ), ++i ) ;
        for ( int j = 0; j < n; scanf ( "%d", &b[j] ), ++j ) ;

        printf ( "Twin Towers #%d\n", Case++ );
        printf ( "Number of Tiles : %d\n\n", LCS ( a, b ) );
    }
    return 0;
}