初始化 init
for (int i=1;i<=n;++i)
scanf("%d",&a[i]),stmax[i][0]=stmin[i][0]=a[i];
预处理
for (int j=1;j<sz;++j)
for (int i=1;i<=n;++i)
if (i+(1<<j)-1<=n){
stmax[i][j]=max(stmax[i][j-1],stmax[i+(1<<(j-1))][j-1]);
stmin[i][j]=min(stmin[i][j-1],stmin[i+(1<<(j-1))][j-1]);
}
查询
for (int i=1;i<=m;++i){
scanf("%d%d",&l,&r);
if (l>r) swap(l,r);
k=floor(log((double)(r-l+1))/log((double)(2)));
Max=max(stmax[l][k],stmax[r-(1<<k)+1][k]);
Min=min(stmin[l][k],stmin[r-(1<<k)+1][k]);
printf("%d\n",Max-Min);
}