wenbao与LCIS（最长公共上升子序列）

http://acm.hdu.edu.cn/showproblem.php?pid=5904

#include <iostream>
#include <stdio.h>
using namespace std;
const int maxn = 1e6+10;
const int maxn2 = 1e5+10;
int sum1[maxn], sum2[maxn], c[maxn2], d[maxn2];
int main(){
    int t, n, m, x;
    scanf("%d", &t);
    while(t--){
        int ma = 0;
        scanf("%d %d", &n, &m);
        for(int i = 0; i < n; i++){
            scanf("%d", &c[i]);
            sum1[c[i]] = sum1[c[i]-1] + 1;
        }
        for(int i = 0; i < m; i++){
            scanf("%d", &d[i]);
            sum2[d[i]] = sum2[d[i]-1] + 1;
        }
        for(int i = 0; i < n; i++) ma = max(ma, min(sum1[c[i]], sum2[c[i]]));
        printf("%d
", ma);
        // memset(sum1, 0, sizeof(sum1));    //too young
        // memset(sum2, 0, sizeof(sum2));    //too young
        for(int i = 0; i < n; i++) sum1[c[i]] = 0;
        for(int j = 0; j < m; j++) sum2[d[j]] = 0;
    }
    return 0;
}

只有不断学习才能进步！