zoj 2432 模板LCIS

输出一条 LCIS

#include "bits/stdc++.h"
using namespace std;
int T;
int len1, len2;
int s1[510], s2[510];
int dp[510][510];
int choice[510][510];


int main()
{
    scanf("%d", &T);
    while(T--) {
        memset(dp, 0, sizeof(dp));
        memset(choice, 0, sizeof(choice));
        scanf("%d", &len1);
        int i, j;
        for(i = 1; i <= len1; ++i) {
            scanf("%d", &s1[i]);
        }
        scanf("%d", &len2);
        for(j = 1; j <= len2; ++j) {
            scanf("%d", &s2[j]);
        }

        for(i = 1; i <= len1; ++i) {
            int k = 0;
            for(j = 1; j <= len2; ++j) {
                if(s1[i] == s2[j]) {
                    dp[i][j] = dp[i - 1][k] + 1;
                    choice[i][j] = 1000 * (i - 1) + k;
                }
                else {
                    dp[i][j] = dp[i - 1][j];
                    choice[i][j] = choice[i - 1][j];
                    if(s1[i] > s2[j] && dp[i - 1][k] < dp[i - 1][j]) {
                        k = j;
                    }
                }
//                printf("dp[%d][%d] == %d
", i ,j, dp[i][j]);
            }
        }

        int end_pos;
        int res = 0;
        for(j = 1; j <= len2; ++j) {
            if(res < dp[len1][j]) {
                res = dp[len1][j];
                end_pos = j;
            }
        }
        printf("%d
", res);
        if(res == 0) {
            continue;
        }
        int state_1, state_2, tmp;
        state_1 = len1;
        state_2 = end_pos;
        int tot_ans = 0;
        while(state_2) {
            ++tot_ans;
            s1[tot_ans] = s2[state_2];
            tmp = choice[state_1][state_2];
            state_1 = tmp / 1000;
            state_2 = tmp % 1000;
        }
        while(tot_ans) {
            printf("%d ", s1[tot_ans]);
            --tot_ans;
        }
        printf("
");
    }
}
//2
//5
//1 4 2 5 -12
//4
//-12 1 2 4


//2
//5
//1 2 3 4 5
//1
//9