题目链接:http://poj.org/problem?id=3264
题目大意:n个元素,q次查询,查询区间最值
思路:ST表
ACCode:
#include<stdlib.h>
#include<string.h>
#include<stdio.h>
#include<time.h>
#include<math.h>
// srand(unsigned)time(NULL));rand();
#include<map>
#include<set>
#include<deque>
#include<queue>
#include<stack>
#include<bitset>
#include<string>
#include<fstream>
#include<iostream>
#include<algorithm>
#define ll long long
#define Pair pair<int,int>
#define clean(a,b) memset(a,b,sizeof(a))
using namespace std;
const int MAXN=1e5+10;
const int INF32=0x3f3f3f3f;
const ll INF64=0x3f3f3f3f3f3f3f3f;
const ll MOD=1e9+7;
const double PI=acos(-1.0);
const double EPS=1.0e-8;
//unsigned register
// ios::sync_with_stdio(false)
class STtable{
ll STmax[MAXN][20],STmin[MAXN][20],mn[MAXN];
public : void IntST(int n,ll a[]){
mn[0]=-1;
for(int i=1;i<=n;++i){
mn[i]=((i&(i-1))==0)?mn[i-1]+1:mn[i-1];
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]);
}
}
}
public : ll RMQMAX(int l,int r){
int k=mn[r-l+1];
return max(STmax[l][k],STmax[r-(1<<k)+1][k]);
}
public : ll RMQMIN(int l,int r){
int k=mn[r-l+1];
return min(STmin[l][k],STmin[r-(1<<k)+1][k]);
}
};
STtable ST;
ll A[MAXN];
int n,m;
int main(){
int n,m;scanf("%d%d",&n,&m);
for(int i=1;i<=n;++i) scanf("%lld",&A[i]);
ST.IntST(n,A);
for(int i=1;i<=m;++i){
int l,r;scanf("%d%d",&l,&r);
printf("%d\n",ST.RMQMAX(l,r)-ST.RMQMIN(l,r));
}
}