POJ 3264 线段树

题意

传送门 POJ 3264

题解

线段树维护区间的最大值和最小值即可。

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define min(a,b)    (((a) < (b)) ? (a) : (b))
#define max(a,b)    (((a) > (b)) ? (a) : (b))
#define abs(x)    ((x) < 0 ? -(x) : (x))
#define INF 0x3f3f3f3f
#define delta 0.85
#define eps 1e-5
#define PI 3.14159265358979323846
#define MAX_N 50005
using namespace std;
typedef pair<int, int> P;
const int ST_SIZE = (1 << 17) - 1;
int N, Q;
int H[MAX_N];
P st[ST_SIZE]; // max, min

void init(int k, int l, int r){ // [l, r)
	if(r - l == 1) st[k] = P(H[l], H[l]);
	else{
		int chl = (k << 1) + 1, chr = (k << 1) + 2, m = (l + r) >> 1;
		init(chl, l, m);
		init(chr, m, r);
		st[k] = P(max(st[chl].first, st[chr].first), min(st[chl].second, st[chr].second));
	}
}

P query(int a, int b, int k, int l, int r){
	if(b <= l || r <= a) return P(-INF, INF);
	else if(a <= l && r <= b) return st[k];
	else{
		int chl = (k << 1) + 1, chr = (k << 1) + 2, m = (l + r) >> 1;
		P p1 = query(a, b, chl, l, m), p2 = query(a, b, chr, m, r);
		return P(max(p1.first, p2.first), min(p1.second, p2.second));
	}
}

int main(){
	while(~scanf("%d%d", &N, &Q)){
		for(int i = 0; i < N; i++) scanf("%d", H + i);
		init(0, 0, N);
		for(int i = 0; i < Q; i++){
			int a, b;
			scanf("%d%d", &a, &b);
			P p = query(a - 1, b, 0, 0, N);
			printf("%d\n", p.first - p.second);
		}
	}
	return 0;
}