hdu 1423 GCIS 模板题

//GCIS

#include "iostream"
#include "cstdio"
#include "cstring"
#include "algorithm"
using namespace std;
int dp[510], Max;
int s1[510], s2[510];
int len1, len2;

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

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

int main()
{
    scanf("%d", &T);
    while(T--) {
        memset(dp, 0, sizeof(dp));
        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;
                }
                else {
                    dp[i][j] = dp[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 res = 0;
        for(j = 1; j <= len2; ++j) {
            res = max(res, dp[len1][j]);
        }
        printf("%d
", res);
        if(T) {
            printf("
");
        }
    }
}
//2
//5
//1 4 2 5 -12
//4
//-12 1 2 4