poj 3264 Balanced Lineup//一维ST

 Balanced Lineup

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <climits>
using namespace std;
#define LL long long
#define mod 1000000007
#define MAXN 100005
int stmax[MAXN][21],stmin[MAXN][21],mn[MAXN];
int a[MAXN];
void init(int n){
    mn[0]=-1;
    for (int i=1;i<=n;i++){
        mn[i]=((i & (i-1))==0) ? mn[i-1]+1 : mn[i-1];//可以是log((double)i)/log(2 .0)
        stmax[i][0]=stmin[i][0]=a[i];
    }
    for (int j=1;j<=mn[n];j++)
        for (int i=1;i+(1<<j)-1<=n;i++){
            stmax[i][j]=max(stmax[i][j-1],stmax[i+(1<<(j-1))][j-1]);
            stmin[i][j]=min(stmin[i][j-1],stmin[i+(1<<(j-1))][j-1]);
        }
}
int rmq_max(int L,int R){
    int k=mn[R-L+1];
    return max(stmax[L][k],stmax[R-(1<<k)+1][k]);
}
int rmq_min(int L,int R){
    int k=mn[R-L+1];
    return min(stmin[L][k],stmin[R-(1<<k)+1][k]);
}
int main(){
    int n,q;scanf("%d%d",&n,&q);
    for(int i=1;i<=n;i++)scanf("%d",&a[i]);
    init(n);
    while(q--){
        int a,b;
        scanf("%d%d",&a,&b);
        printf("%d\n",rmq_max(a,b)-rmq_min(a,b));
    }
    return 0;
}