LCIS的模板来着的,时间复杂度是O(n),比较简单,直接设f,g分别为a和b以i结尾的lis长度,转移怎么暴力怎么来。。亏我以前还天天log求lis之后辛辛苦苦再求lcs。。。。
#include<cstdio>
#include<algorithm>
#include<cstring>
//#include<cmath>
#include<iostream>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
//int n,m;
typedef long long ll;
const int N=1e6+5;
const int mo=1e9+7;
int f[N],g[N],a[N],b[N];
int main()
{
int cas,n,m;
scanf("%d",&cas);
fo(fuck,1,cas)
{
int ans=0;
scanf("%d%d",&n,&m);
fo(i,1,n)scanf("%d",&a[i]);
fo(i,1,m)scanf("%d",&b[i]);
fo(i,1,n)
{
f[a[i]]=max(f[a[i]-1]+1,f[a[i]]);
}
fo(i,1,m)
{
g[b[i]]=max(g[b[i]],g[b[i]-1]+1);
ans=max(ans,min(f[b[i]],g[b[i]]));
}
printf("%d\n",ans);
fo(i,1,n)f[a[i]]=0;
fo(i,1,m)f[b[i]]=0;
}
return 0;
}