CSU-1120 病毒(最长递增公共子序列)

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

using namespace std;
const int N = 1000 + 5;
int dp[N], a[N], b[N];

void Work(int n, int m){
    int M;
    memset(dp, 0, sizeof(dp));
    for(int i = 1; i <= n; i++){
        M = 0;
        for(int j = 1; j <= m; j++){
            if(a[i] > b[j] && M < dp[j])
                M = dp[j];
            if(a[i] == b[j])
                dp[j] = M + 1;
        }
    }
    printf("%d\n", *max_element(dp + 1, dp + m + 1));
}
int main(){
    int T, n, m;
    scanf("%d", &T);
    while(T --){
        scanf("%d", &n);
        for(int i = 1; i <= n; i++) scanf("%d", &a[i]);
        scanf("%d", &m);
        for(int i = 1; i <= m; i++) scanf("%d", &b[i]);
        Work(n, m);
    }
}