题目链接:http://poj.org/problem?id=3264
题目大意:求区间最大值和最小值的差值
题目思路:RMQ或线段树,这里贴一份线段树代码,求一次区间最大值和最小值作差就行
代码:
#include<cstdio>
#include<cmath>
#include<cstring>
#include<string>
#include<cstdlib>
#include<algorithm>
#include<iostream>
#include<queue>
#include<stack>
#include<map>
using namespace std;
#define FOU(i,x,y) for(int i=x;i<=y;i++)
#define FOD(i,x,y) for(int i=x;i>=y;i--)
#define MEM(a,val) memset(a,val,sizeof(a))
#define PI acos(-1.0)
const double EXP = 1e-9;
typedef long long ll;
typedef unsigned long long ull;
const int INF = 0x3f3f3f3f;
const ll MINF = 0x3f3f3f3f3f3f3f3f;
const double DINF = 0xffffffffffff;
const int mod = 1e9+7;
const int N = 1e6+5;
int a[N],n; //输入数据,构造线段树数组
struct node{
int lft,rht;
int sum; //区间和
int maxx; //区间最大值
int minn; //区间最小值
int lazy; //延迟标记,减小时间复杂度
}segTree[N*4]; //需要开4倍
void pushUp(int id){ //区间合并,上放
segTree[id].sum = segTree[id*2].sum+segTree[id*2+1].sum;
segTree[id].maxx = max(segTree[id*2].maxx,segTree[id*2+1].maxx);
segTree[id].minn = min(segTree[id*2].minn,segTree[id*2+1].minn);
}
void pushDown(int id){
if(segTree[id].lazy){ //区间修改过,需要下放
//在原来的值上加上val
segTree[id*2].sum += (segTree[id*2].rht-segTree[id*2].lft+1)*segTree[id].lazy;
segTree[id*2+1].sum += (segTree[id*2+1].rht-segTree[id*2+1].lft+1)*segTree[id].lazy;
segTree[id*2].maxx += segTree[id].lazy;
segTree[id*2+1].maxx += segTree[id].lazy;
segTree[id*2].minn += segTree[id].lazy;
segTree[id*2+1].minn += segTree[id].lazy;
segTree[id*2].lazy += segTree[id].lazy;
segTree[id*2+1].lazy += segTree[id].lazy;
segTree[id].lazy = 0;
}
}
void build(int id,int l,int r){
segTree[id].lft = l, segTree[id].rht = r;
segTree[id].lazy = 0, segTree[id].sum = 0; //开始一定要清0
if(l == r){ //到达叶子节点,不继续建树
segTree[id].maxx = a[l];
segTree[id].minn = a[l];
}
else{ //否则继续建树
int mid = (l+r)>>1;
build(id*2,l,mid);
build(id*2+1,mid+1,r);
pushUp(id);
}
}
int queryMin(int id,int l,int r){ //查询l~r的值
if(l<=segTree[id].lft&&r>=segTree[id].rht){ //该区间包含在查询区间内,可直接返回
return segTree[id].minn;
}
pushDown(id); //区间下放
int mid = (segTree[id].lft+segTree[id].rht)>>1;
int maxx = -INF;
int minn = INF;
if(r<=mid){ //只用管左子树
minn = min(minn,queryMin(id*2,l,r));
}
else if(l>=mid+1){ //只用管右子树
minn = min(minn,queryMin(id*2+1,l,r));
}
else{
minn = min(minn,min(queryMin(id*2,l,r),queryMin(id*2+1,l,r)));
}
return minn;
}
int queryMax(int id,int l,int r){ //查询l~r的值
if(l<=segTree[id].lft&&r>=segTree[id].rht){ //该区间包含在查询区间内,可直接返回
return segTree[id].maxx;
}
pushDown(id); //区间下放
int mid = (segTree[id].lft+segTree[id].rht)>>1;
int maxx = -INF;
int minn = INF;
if(r<=mid){ //只用管左子树
maxx = max(maxx,queryMax(id*2,l,r));
}
else if(l>=mid+1){ //只用管右子树
maxx = max(maxx,queryMax(id*2+1,l,r));
}
else{
maxx = max(maxx,max(queryMax(id*2,l,r),queryMax(id*2+1,l,r)));
}
return maxx;
}
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
std::ios::sync_with_stdio(false);
int q,l,r;
while(~scanf("%d%d",&n,&q))
{
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
build(1,1,n);
while(q--)
{
scanf("%d%d",&l,&r);
printf("%d\n",queryMax(1,l,r)-queryMin(1,l,r));
}
}
return 0;
}