#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<string>
#include<cstring>
using namespace std;
int n,m;
int a[100005]={0};
int f[100005][25]={0};
int rmq(int l,int r)
{
int k=0;
k=log2(r-l+1);
while((1<<(k+1))<=(r-l+1)) k++;
return max(f[l][k],f[r-(1<<k)+1][k]);
}
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++) {scanf("%d",&a[i]); f[i][0]=a[i];}
for(int j=1;(1<<j)<=n;j++)
for(int i=1;i+(1<<j)-1<=n;i++)
f[i][j]=max(f[i][j-1],f[i+(1<<(j-1))][j-1]);
int x,y;
while(m--)
{
scanf("%d%d",&x,&y);
printf("%d\n",rmq(x,y));
}
return 0;
}
ST表
最新推荐文章于 2021-10-13 18:54:52 发布