#include<bits/stdc++.h> 
using namespace std;
int n,m,lg2[100009],f[100009][20];
inline int read(){
	int x=0,f=1;char ch=getchar();
	while (ch<'0'||ch>'9'){if (ch=='-') f=-1;ch=getchar();}
	while (ch>='0'&&ch<='9'){x=x*10+ch-48;ch=getchar();}
	return x*f;
}//快读啊你为什么偏偏是快读呢 
inline int max(int a,int b){return a>b?a:b;}
int main(){
	//freopen("P3865_4.in","r",stdin);
	//freopen("out.out","w",stdout);
	n=read(),m=read();
	for(int i=1;i<=n;i++){
		f[i][0]=read();
	}
	lg2[1]=0;
	for(int i=2;i<=n+9;i++) lg2[i]=lg2[i>>1]+1;
	//for(int i=1;i<=n;i++) printf("lg2[%d]=%d\n",i,lg2[i]);
	for(int j=1;j<=lg2[n];j++){
		for(int i=1;i<=n-(1<<j)+1;i++){
			f[i][j]=max(f[i][j-1],f[i+(1<<(j-1))][j-1]);
		}
	}
	//for(int i=1;i<=n;i++) for(int j=0;j<=lg2[n];j++) printf("f[%d][%d]=%d\n",i,j,f[i][j]);
	for(int i=1,l,r,len;i<=m;i++){
		l=read(),r=read();
		len=lg2[r-l+1];
		printf("%d\n",max(f[l][len],f[r-(1<<len)+1][len]));
	} 
	return 0;
}

提交记录

从第四个点开始就清一色的“Wrong Answer.wrong answer Too short on line 17.”