POJ3264链接
题意很简单,多次查询给定区间的最大值和最小值.树状数组的区间求值问题这里有讲解点击进入特别注意输入要用scanf.
#include<iostream>
#include<cstring>
#include<cmath>
#include<vector>
#include<cstdio>
#define lowbit(x) ((x)&(-x))
const int maxn=5e4+10;
using namespace std;
int arr[maxn],n,treex[maxn];
vector<int>treei(maxn,1<<30);//初始化treei全为无穷大
void update(int x,int val)
{
while(x<=n)
{
treex[x]=max(treex[x],val);
treei[x]=min(treei[x],val);
x+=lowbit(x);
}
}
void query(int L,int R,int &ans1,int &ans2)
{
int len=R-L+1;
while(len&&R)
{
if(lowbit(R)<=len)
{
ans1=max(treex[R],ans1);
ans2=min(treei[R],ans2);
len-=lowbit(R);
R-=lowbit(R);
}
else
{
ans1=max(ans1,arr[R]);
ans2=min(ans2,arr[R]);
len--,R--;
}
}
}
int main()
{
int q;
scanf("%d%d",&n,&q);
for(int i=1;i<=n;i++)
{
scanf("%d",&arr[i]);
update(i,arr[i]);
}
while(q--)
{
int a,b;
scanf("%d%d",&a,&b);
int ans1=0,ans2=1<<30;
query(a,b,ans1,ans2);
printf("%d\n",ans1-ans2);
}
return 0;
}