求hark

#include<bits/stdc++.h>
#define inf 0x90909090//估计应该差不多大了吧 不知道合不合适
using namespace std;
const int MAX=1e6+10;
int a[MAX],b[MAX],book[MAX],re[MAX],amax[MAX];
int t,n;
int max0,max0num,max1,max1num;
void findmax(int i){
	if(amax[i]>max0){
		max1=max0;max0=amax[i];
	}else if(amax[i]>max1)
		max1=amax[i];
}

void init(){
	max0=max1=inf;
	max0num=max1num=0;
	memset(book,0,sizeof(book));
	memset(amax,0x90,sizeof(amax));
	memset(re,0x90,sizeof(re));
}

void print(){
	printf("\ni book amax re\n");
	for(int i=0;i<10;i++){
		printf("%2d%2d%2d%2d\n",i,book[i],amax[i],re[i]);
	}
}

int main(){
	cin>>t;
	while(t--){
		init();
		scanf("%d",&n);
		for(int i=0;i<n;i++) scanf("%d",&a[i]);
		for(int i=0;i<n;i++){scanf("%d",&b[i]);b[i]=min(n+1,b[i]);}
		for(int i=0;i<n;i++){
			book[b[i]]++;//记录一下数量
			amax[b[i]]=max(amax[b[i]],a[i]);//寻找B为p下的A最大值
		}for(int i=0;i<n;i++) findmax(i);
		for(int i=0;i<=n;i++){//枚举p
			re[n-book[i]]=max(re[n-book[i]],
			(amax[i]==max0?max1: max0)-i);
		}
		for(int i=n;i;i--) re[i]=max(re[i],re[i+1]);
		for(int i=1;i<=n;i++) printf("%d\n",re[i]);
		//print();
	}
	return 0;
}