题目:http://acm.hust.edu.cn/vjudge/contest/view.action?cid=27676#problem/A
代码:
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int inf=10000005;
struct node
{
int l,r;
int maxn,minn;
}E[200005*4];
int a[200005],nmaxn,nminn;
void init(int i,int l,int r)
{
E[i].l=l,E[i].r=r;
if(l==r)
{
E[i].maxn=E[i].minn=a[l];
return;
}
int mid=(l+r)/2;
init(2*i,l,mid);
init(2*i+1,mid+1,r);
E[i].maxn=max(E[2*i].maxn,E[2*i+1].maxn);
E[i].minn=min(E[2*i].minn,E[2*i+1].minn);
}
void Query(int i,int l,int r)
{
if(E[i].maxn<=nmaxn&&E[i].minn>=nminn)return ;
if(E[i].l==l&&E[i].r==r)
{
nmaxn=max(E[i].maxn,nmaxn);
nminn=min(nminn,E[i].minn);
return ;
}
int mid=(E[i].l+E[i].r)/2;
if(r<=mid) Query(2*i,l,r);
else if(l>mid) Query(2*i+1,l,r);
else
{
Query(2*i,l,mid);
Query(2*i+1,mid+1,r);
}
}
int main()
{
int n,q,l,r;
while(~scanf("%d%d",&n,&q))
{
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
}
init(1,1,n);
for(int i=1;i<=q;i++)
{
scanf("%d%d",&l,&r);
nmaxn=-inf,nminn=inf;
Query(1,l,r);
printf("%d\n",nmaxn-nminn);
}
}
}