UVa10405 - Longest Common Subsequence （ 最长公共子序列 ）

只要在输入的时候注意space即可。没难度。。。

#include <iostream>
#include <cstring>
#include <algorithm>
#include <string>
#include <cstdio>

using namespace std;

string str1, str2;
int a[1005][1005];

int LCS ( string s1, string s2 ) {
    int m = s1.length ( ), n = s2.length ( );                                                                                                                                            
    a[0][0] = 0;
    for ( int i = 1; i <= m; a[i][0] = 0, ++i ) ;
    for ( int i = 1; i <= n; a[0][i] = 0, ++i ) ;
    for ( int i = 1; i <= m; ++i ) 
        for ( int j = 1; j <= n; ++j ) {
            if ( s1[i - 1] == s2[j - 1] ) a[i][j] = a[i - 1][j - 1] + 1;
            else if ( a[i - 1][j] > a[i][j - 1] ) a[i][j] = a[i - 1][j];
            else a[i][j] = a[i][j - 1];
        }
    return a[m][n];
}

int main ( ) {
    while ( getline ( cin, str1 ) ) {
        getline ( cin, str2 );
        memset ( a, -1, sizeof ( a ) );
        cout << LCS ( str1, str2 ) << endl;
    }
}