求调C

#include<bits/stdc++.h>
using namespace std;
const int N=1e5;
int n,q,a[N+5],f[N+5][101],x,logg[N+5];
int max(int xx,int yy){
	return (xx>yy)?xx:yy;
}int min(int xx,int yy){
	return (xx<yy)?xx:yy;
}
int work(int xx,int yy){
	int k=logg[yy-xx+1];
	return min(f[xx][k],f[yy-(1<<k)+1][k]);
}
signed main(){
	scanf("%d%d",&n,&q);
    logg[0]=-1;
	for(int i=1;i<=n;i++){
		scanf("%d",&a[i]);
		logg[i]=logg[i>>1]+1;
        f[i][0]=a[i];
	}for(int j=1;j<=logg[n];j++){
		for(int i=1;i+(1<<j)-1<=n;i++){
			f[i][j]=min(f[i][j-1],f[i+(1<<(j-1))][j-1]);
		}
	}while(q--){
		int k,last=0,minn=2*1e9;
		scanf("%d",&x);
		for(int i=1;i<=x+1;i++){
			if(i<=x) scanf("%d",&k);
			else k=n+1;
			if(k==last+1){
				last=k;
				continue;
			}
			//cout << k << ' ' << last << endl;
			if(k==last+3){
				minn=min(minn,min(a[k-1],last+1));
			}else minn=min(minn,work(k-1,last+1));
			last=k;
		}cout << minn << endl;
	}
}