#include<stdio.h>
#include<string.h>
#include<string>
#include<math.h>
#include<algorithm>
#include<iostream>
#include<queue>
#include<vector>
#include<stack>
#include<map>
#include<set>
#include<stdlib.h>
#include<time.h>
#include <iomanip>
#define lowbit(x) (x&(-x))
#define inf 0x3f3f3f3f
#define fill(x,y) memset(x,y,sizeof(x))
#define fup(i,x,y) for(int i=(x);i<=(y);i++)
#define fdn(i,x,y) for(int i=(x);i>=(y);i--)
#define pf printf
#define sf scanf
#define sp(x) setprecision(x)
#define sd(n) scanf("%d",&n)
#define sdd(n,m) scanf("%d%d",&n,&m)
#define sddd(n,m,k) scanf("%d%d%d",&n,&m,&k)
#define sld(n) scanf("%lld",&n)
#define sldd(n,m) scanf("%lld%lld",&n,&m)
#define slddd(n,m,k) scanf("%lld%lld%lld",&n,&m,&k)
#define sf(n) scanf("%lf",&n)
#define sff(n,m) scanf("%lf%lf",&n,&m)
#define sfff(n,m,k) scanf("%lf%lf%lf",&n,&m,&k)
#define pf(x) printf("%d\n",x)
#define pfl(x) printf("%lld\n",x)
#define N 10005
#define M 400009
#define mod 1000000
#define pi acos(-1)
//cout.setf(ios::fixed);
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
using namespace std;
typedef long long ll;
typedef double db;
const long long linf = 0x3f3f3f3f3f3f3f3fll;
inline int scan()
{
int res=0,ch,flag=0;
if((ch=getchar())=='-')flag=1;
else if(ch>='0' && ch<='9')res=ch-'0';
while((ch=getchar())>='0'&&ch<='9')res=res*10+ch-'0';
return flag ? -res : res;
}
int ma[500005][25],mi[500005][25];
void rmq(int n)
{
for(int j=1;(1<<j)<=n;j++)
{
for(int i=1;i+(1<<j)<=n+1;i++)
{
ma[i][j]=max(ma[i][j-1],ma[i+(1<<(j-1))][j-1]);
mi[i][j]=min(mi[i][j-1],mi[i+(1<<(j-1))][j-1]);
}
}
}
int maxx(int l,int r)
{
int k=log2(r-l+1);
return max(ma[l][k],ma[r-(1<<k)+1][k]);
}
int minn(int l,int r)
{
int k=log2(r-l+1);
return min(mi[l][k],mi[r-(1<<k)+1][k]);
}
int main()
{
int n,q;
sdd(n,q);
fup(i,1,n)
sd(ma[i][0]),mi[i][0]=ma[i][0];
rmq(n);
while(q--)
{
int l,r;
sdd(l,r);
pf(maxx(l,r)-minn(l,r));
}
return 0;
}
RMQ poj3264
最新推荐文章于 2019-01-22 20:24:00 发布