UVA 10635 Prince and Princess

#include    <iostream>
#include    <cstdio>
#include    <cstdlib>
#include    <algorithm>
#include    <vector>
#include    <cstring>
#include    <queue>
#include    <complex>
#include    <stack>
#define LL long long int
#define dob double
#define lb(x) (x&-x)
#define FILE "10635"
using namespace std;

const int N = 70010;
int n,p,q,bin
,T
,Ans;

inline int gi(){
int x=0,res=1;char ch=getchar();
while(ch>'9'||ch<'0'){if(ch=='-')res*=-1;ch=getchar();}
while(ch<='9'&&ch>='0')x=x*10+ch-48,ch=getchar();
return x*res;
}

inline int query(int x,int res=0){
for(;x;x-=lb(x))res=max(res,T[x]);
return res;
}

inline void update(int x,int val){
for(;x<=n*n;x+=lb(x))T[x]=max(T[x],val);
}

inline void solve(){
n=gi();p=gi()+1;q=gi()+1;Ans=0;
memset(bin,0,sizeof(bin));memset(T,0,sizeof(T));
for(int i=1;i<=p;++i)bin[gi()]=i;
for(int i=1;i<=q;++i){
int y=bin[gi()];if(!y)continue;
int v=query(y)+1;if(v>Ans)Ans=v;
update(y,v);
}
printf("%d\n",Ans);
}

int main()
{
freopen(FILE".in","r",stdin);
freopen(FILE".out","w",stdout);
int Case=gi();
for(int t=1;t<=Case;++t)
printf("Case %d: ",t),solve();
fclose(stdin);fclose(stdout);
return 0;
}