POJ 3264(2) Balanced Lineup

这次不用区间扩展了。

//Memory    Time
//1188K    2282MS
#include <cstdio>
#include <iostream>
#include <cstring>
#include <climits>
using namespace std;
#define lson(x) ((x)<<1)
#define rson(x) ((x)<<1 | 1)

const int MAXN = 50000;
const int INF = INT_MAX;
int dat1[MAXN<<2], dat2[MAXN<<2];
int n, Q;

void init(int n){
    for(int i=1; i<=n; i++){
        dat1[i] = INF;
        dat2[i] = 0;
    }
}

inline void PushUp(int rt){
    dat1[rt] = min(dat1[lson(rt)], dat1[rson(rt)]);
    dat2[rt] = max(dat2[lson(rt)], dat2[rson(rt)]);
}

void build(int rt, int l, int r){
    if(l+1 == r){
            scanf("%d", &dat1[rt]);
            dat2[rt] = dat1[rt];
    }
    else{
        build(lson(rt), l, (l+r)>>1);
        build(rson(rt), (l+r)>>1, r);
        PushUp(rt);
    }
}

int querymin(int a, int b, int k, int l, int r){
    if(b <= l || r <= a) return INF;
    else if(a <= l && r <= b) return dat1[k];
    else{
        int vl = querymin(a, b, lson(k), l, (l+r)>>1);
        int vr = querymin(a, b, rson(k), (l+r)>>1, r);
        return min(vl, vr);
    }
}

int querymax(int a, int b, int k, int l, int r){
    if(b <= l || r <= a) return 0;
    else if(a <= l && r <= b) return dat2[k];
    else{
        int vl = querymax(a, b, lson(k), l, (l+r)>>1);
        int vr = querymax(a, b, rson(k), (l+r)>>1, r);
        return max(vl, vr);
    }
}

int main(){
    while(scanf("%d %d", &n, &Q) != EOF){
       init(n);
       build(1, 1, n+1);
       while(Q--){
           int a, b;
           scanf("%d %d", &a, &b);
           int low = querymin(a, b+1, 1, 1, n+1);
           int high = querymax(a, b+1, 1, 1, n+1);
           printf("%d\n", high - low);
       }
    }
    return 0;
}