Nonsense Time

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

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
#include <ctime>
//#include <tr1/unordered_map>
//#include <unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 8e19
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
//#define pii pair<int,int>
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

template<typename T>inline void read(T &x)
{
    x=0;
    static int p;p=1;
    static char c;c=getchar();
    while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
    while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
    x*=p;
}

//-----------------------------------------------
const int maxn=1e5+9;
const int maxm=1e6;
const int mod=998244353;

int a[maxn],b[maxn],k[maxn],tmp[maxn];
bool vis[maxn];
int ans[maxn];

int Search(int num,int low,int high)
{
    int mid;
    while(low<=high)
    {
        mid=(low+high)/2;
        if(num>=b[mid]) low=mid+1;
        else high=mid-1;
    }
    return low;
}
int Dp(int n)
{
    for(int i=0;i<=n;i++) b[i]=0,tmp[i]=0,vis[i]=0;

    int i,len,pos;
    b[1]=a[1];
    len=1;
    for(int i=2;i<=n;i++)
    {
        if(a[i]!=INF)
        {
            if(a[i]>=b[len])
            {
                len=len+1;
                b[len]=a[i];
                tmp[i]=len;
            }
            else
            {
                pos=Search(a[i],1,len);
                b[pos]=a[i];
                tmp[i]=pos;
            }
        }

    }

    int tlen=len;
    for(int i=n;i>=1;i--)
    {
        if(tlen<=0) break;
        if(tmp[i]==tlen) vis[i]=1,tlen--;
    }

    return len;
}

int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);


    int T;
    sfi(T);
    while(T--)
    {
        int n;
        sfi(n);
        for(int i=1;i<=n;i++) sfi(a[i]);

        int len=Dp(n);

        for(int i=1;i<=n;i++) sfi(k[i]);

        for(int i=n;i>=1;i--)
        {
            ans[i]=len;
            if(vis[k[i]])
            {
                a[k[i]]=INF;
                len=Dp(n);
            }
            else
            {
                a[k[i]]=INF;
            }
        }

        for(int i=1;i<=n;i++)
        {
            if(i!=1) printf(" ");
            printf("%d",ans[i]);
        }
        printf("\n");
    }


    return 0;
}