#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
#define maxn 50005
#define inf 0x3f3f3f3f
int n,q;
int a[maxn],ll[maxn<<2],rr[maxn<<2],mi[maxn<<2],ma[maxn<<2];//maxn<<1|1相当于乘二加一
inline void pushup(int i){
ma[i]=max(ma[i<<1],ma[i<<1|1]);
mi[i]=min(mi[i<<1],mi[i<<1|1]);
}
void build(int l,int r,int i){
ll[i]=l;
rr[i]=r;
if(l==r){
mi[i]=a[l];
ma[i]=a[l];
return ;
}
int m=(ll[i]+rr[i])>>1,ls=i<<1,rs=ls|1;
build(l,m,ls);
build(m+1,r,rs);
pushup(i);
}
int query1(int l,int r,int i){//min
if(l<=ll[i]&&rr[i]<=r){
return mi[i];
}
int m=(ll[i]+rr[i])>>1,ls=i<<1,rs=ls|1;
int ans=inf;
if(l<=m)ans=min(ans,query1(l,r,ls));
if(m<r)ans=min(ans,query1(l,r,rs));
return ans;
}
int query2(int l,int r,int i){//max
if(l<=ll[i]&&rr[i]<=r){
return ma[i];
}
int m=(ll[i]+rr[i])>>1,ls=i<<1,rs=ls|1;
int ans=0;
if(l<=m)ans=max(ans,query2(l,r,ls));
if(m<r)ans=max(ans,query2(l,r,rs));
return ans;
}
int main()
{
int u,v;
//freopen("in.txt","r",stdin);
while(~scanf("%d%d",&n,&q)){
for(int i=1;i<=n;i++){
scanf("%d",&a[i]);
}
build(1,n,1);
for(int i=0;i<q;i++){
scanf("%d%d",&u,&v);
printf("%d\n",query2(u,v,1)-query1(u,v,1));
}
}
}
多谢评论区大佬指出错误,应该是四倍