平衡的阵容

#include <iostream>
#include <cstdio>
using namespace std;
int read()
{
	int x=0,f=1;
	char c=getchar();
	while(c<'0'||c>'9')
	{
		if(c=='-')  f=-1;
		c=getchar();
	}
	while(c>='0'&&c<='9')
	{
		x=x*10+c-'0';
		c=getchar();
	}
	return f*x;
}
const int N=60000,logN=20;
int log[N],mx[N][logN+5],mi[N][logN+5];
int n,q,l,r,a[N],s1,s2;
int main()
{
	n=read();  q=read();
	for(int i=1;i<=n;i++)  a[i]=read();
	log[0]=-1;
	for(int i=1;i<=n;i++)  {
	    mi[i][0]=a[i];
		mx[i][0]=a[i];
		log[i]=log[i>>1]+1;
	}
	for(int j=1;j<=logN;j++)
	  for(int i=1;i+(1<<j)-1<=n;i++)
	  {
	  	mx[i][j]=max(mx[i][j-1],mx[i+(1<<j-1)][j-1]);
	  	mi[i][j]=min(mi[i][j-1],mi[i+(1<<j-1)][j-1]);
	  }
	while(q--)
	{
		l=read();  r=read();
		int s=log[r-l+1];
		cout<<max(mx[l][s],mx[r-(1<<s)+1][s])-min(mi[l][s],mi[r-(1<<s)+1][s])<<"\n";
	}
   return 0;
}