效率至上
Time Limit: 5000MS Memory Limit: 65536KB
Problem Description
题意很简单,给出一个数目为n的非有序序列,然后有m次查询.对于每次查询输入两个正整数l,r请输出区间[l,r]的最大值与最小值的差值
Input
第一行:输入两个正整数
n,m (1<=n<=50000, 1<=m<=200000 )
;
第二行:输入n个整数 大小范围为[1,100000];
接下来的m行,每次两个正整数l,r (1<=l<=r<=n);
Output
输出区间
[l,r]
最大值与最小值的差值
.
Example Input
6 31734251 54 62 2
Example Output
630
Hint
Author
#include <stdio.h>
#include <string.h>
#define M 50005
const int INF = 0x3f3f3f3f;
long long int Max[4*M],Min[4*M],sum[4*M]; //该区间最大值,最小值,和
int max(int a,int b)
{
return a>b?a:b;
}
int min(int a,int b)
{
return a<b?a:b;
}
void pushup(int bh) //递归求该节点值
{
sum[bh] = sum[bh*2] + sum[bh*2+1];
Max[bh] = max(Max[bh*2],Max[bh*2+1]);
Min[bh] = min(Min[bh*2],Min[bh*2+1]);
}
void build(int l,int r,int bh) //建树 l为起点,r终点,bh当前节点编号
{
if(l == r)
{
scanf("%lld",&sum[bh]);
Min[bh] = Max[bh] = sum[bh];
return ;
}
int m = (l+r)/2;
build(l,m,bh*2);
build(m+1,r,bh*2+1);
pushup(bh);
}
void updata(int p,long long int v,int l,int r,int bh) //第p区间加v
{
if(l == r)
{
sum[bh] += v;
return ;
}
int m = (l+r)/2;
if(p <= m)
updata(p,v,l,m,bh*2);
else
updata(p,v,m+1,r,bh*2+1);
pushup(bh);
}
long long int ask(int L,int R,int l,int r,int bh) //求L到R的和
{
if(L<=1&&r<=R)
return sum[bh];
int m = (l+r)/2;
int temp = 0;
if(L<=m) temp += ask(L,R,l,m,bh*2);
if(R>m) temp += ask(L,R,m+1,r,bh*2+1);
return temp;
}
long long int askmax(int L,int R,int l,int r,int bh) //求最大值
{
if(L<=l&&r<=R) return Max[bh];
int m = (l+r)/2;
long long int temp = -INF;
if(L<=m)
temp = max(temp,askmax(L,R,l,m,bh*2));
if(R>m)
temp = max(temp,askmax(L,R,m+1,r,bh*2+1));
return temp;
}
long long int askmin(int L,int R,int l,int r,int bh)
{
if(L<=l&&R>=r)
return Min[bh];
int m = (l+r)/2;
long long int temp = INF;
if(L <= m) temp = min(temp,askmin(L,R,l,m,bh*2));
if(R>m) temp = min(temp,askmin(L,R,m+1,r,bh*2+1));
return temp;
}
int main()
{
int n,l,r,o;
long long int num;
while(scanf("%d",&n) != EOF)
{
scanf("%d",&o);
build(1,n,1);
for(int i = 0;i < o;i++)
{
scanf("%d %d",&l,&r);
num = askmax(l,r,1,n,1) - askmin(l,r,1,n,1);
printf("%lld\n",num);
}
}
return 0;
}