}else{
s=toLeft[level][qleft-1];
ss=toLeft[level][qright]-s;
}
int newl,newr;
if(k<=ss){//查询左边
newl=left+s;
newr=left+s+ss-1;
return query(level+1,left,mid,newl,newr,k);
}else{//查询右边
newl=mid-left+1+qleft-s;
newr=mid-left+1+qright-s-ss;
return query(level+1,mid+1,right,newl, newr,k - ss);
}
}
int main()
{
int n,m,cas,ca=0;
scanf("%d",&cas);
while(cas--)
{
printf("Case %d:\n",++ca);
scanf("%d %d",&n,&m);
for(i=1;i<=n;i++){
scanf("%d",&tree[0][i]);
sorted[i]=tree[0][i];
}
sort(sorted+1,sorted+n+1);
build(0,1,n);
int ql,qr,num,ans=0;
for(i=0;i
scanf("%d %d %d",&ql,&qr,&num);
ql++;qr++;//注意这里哦 题意是按从0开始的
int mid,left=1,right=qr-ql+1,ans=0;
mid=(left+right)/2;
while(left<=right)//别少了等于号
{
mid=(left+right)/2;
if(query(0,1,n,ql,qr,mid)>num) right=mid-1;
else {ans=mid;left=mid+1;}//我一开始写的二分法居然不知道是哪里出错了一个劲RE
}
printf("%d\n",ans);
}
} return 0;
}