模板---------RMQ问题ST表

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define re register
#define inl inline
#define LL long long
const int MAXN=1e6+5;
const int LogN=20;
int n,m,ans,l,r;
int f[MAXN][LogN+5],log[MAXN];
int main() 
{
	scanf("%d%d",&n,&m);
	log[0]=-1;
	for(register int i=1;i<=n;i++)
	{
		scanf("%d",&f[i][0]);
		log[i]=log[i>>1]+1;
	}
	for(register int j=1;j<=LogN;j++)
	 for(register int i=1;i+(1<<j)-1<=n;i++)
	  f[i][j]=std::max(f[i][j-1],f[i+(1<<(j-1))][j-1]);
	while(m--)
	{
		scanf("%d%d",&l,&r);
		int x=log[r-l+1];
		ans=std::max(f[l][x],f[r-(1<<x)+1][x]);
		printf("%d\n",ans);
	}
	return 0;
}