请教各位大神一个问题qwq

#include<stdio.h>
#include<string.h>
const unsigned long long MAX=1e10;
int n,arr[1050000],q,arr1[100000000];
unsigned long long list[54000004],list1[54000004],ans;
int judge(){
	for(unsigned long long i=1;i<=list[0];i++){
		unsigned long long beg=list[i]/MAX,end=list[i]%MAX;
	//	printf("%llu %llu\n",beg,end);
		if(beg==end){
			return 1;
		}	
	}
	return 0;//没找到答案，还需要找 
}

void bfs(int n1){
	for(unsigned long long i=1;i<=list[0];i++){
		unsigned long long  beg=list[i]/MAX,end=list[i]%MAX;
		//printf("%llu %d %d\n",list[i],beg,end);
		if((beg+end)%2==1){
			 unsigned long long mid=(beg+end)/2;
			if(arr[mid]>n1){
				list1[++list1[0]]=(beg)*MAX+mid;
				list1[++list1[0]]=(beg)*MAX+mid+1; 
			}
			else if(arr[mid+1]<n1){
				list1[++list1[0]]=(mid)*MAX+end;
				list1[++list1[0]]=(mid+1)*MAX+end; 
			}
			else if(arr[mid]==n1){
				list1[++list1[0]]=(beg)*MAX+mid;
				list1[++list1[0]] =(mid)*MAX+end; 
			}
			else if(arr[mid+1]==n1){
				list1[++list1[0]]=(beg)*MAX+mid+1;
				list1[++list1[0]] =(mid+1)*MAX+end; 
			}
		} 
		else{
			unsigned long long mid=(beg+end)/2;
			if(arr[mid]>n1){//要找的数还在左边；
			list1[++list1[0]]=beg*MAX+mid;
			list1[++list1[0]]=beg*MAX+mid-1; 
			}
			else if(arr[mid]<n1){
				list1[++list1[0]]=(mid)*MAX+end;
				list1[++list1[0]]=(mid+1)*MAX+end; 
			}
			else{
				list1[++list1[0]]=(mid)*MAX+end;
				list1[++list1[0]]=(beg)*MAX+mid; 
			}
		}
	}
	//memcpy(list,list1,sizeof(unsigned long long)*(list1[0]+3));
	for(unsigned long long i=0;i<=list1[0];i++){
		list[i]=list1[i];
	}
	list1[0]=0;
}
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		scanf("%d",&arr[i]);
	}
	scanf("%d",&q);
	
	for(int i=1;i<=q;i++){
		ans=0;
		list[0]=1;list[1]=1*MAX+n;
		
		int remain1=0;
		scanf("%d",&remain1);
		if(remain1<1e8){
			if(!arr1[remain1]){
				while(!judge()){
			ans++;
			bfs(remain1);
		}
		arr1[remain1]=ans;
		printf("%llu\n",ans);
			}
			else{
				printf("%llu\n",arr1[remain1]);
			}
		}
		else{
		
		while(!judge()){
			ans++;
			bfs(remain1);
		}
	
		printf("%llu\n",ans);}
	}
	return 0;
}