UVa 111 - History Grading （最长公共子序列）

来源：互联网发布：实战型锋卫训练场淘宝编辑：程序博客网时间：2024/05/17 03:58

就是在输入的时候遇到了点麻烦。直接敲的模板。。。

#include <iostream>#include <algorithm>#include <cstring>const int MAXN = 25;using namespace std;int correct_order[MAXN], student_order[MAXN], Case, dp[MAXN][MAXN];void LCS ( ) {    for ( int i = 0; i <= Case; ++i ) {        dp[i][0] = 0;        dp[0][i] = 0;    }    for ( int i = 1; i <= Case; ++i ) {        for ( int j = 1; j <= Case; ++j ) {            if ( correct_order[i] == student_order[j] ) 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];        }   }}int main ( ) {    cin >> Case;    int tmp;    for ( int i = 1; i <= Case; ++i ) {        cin >> tmp;        correct_order[tmp] = i;    }    while ( cin >> tmp ) {        student_order[tmp] = 1;        for ( int i = 2; i <= Case; ++i ) {            cin >> tmp;            student_order[tmp] = i;        }        memset ( dp, 0, sizeof ( dp ) );        LCS ( );        cout << dp[Case][Case] << endl;                                                                                                             }}