http://acm.nyist.net/JudgeOnline/problem.php?pid=119&&Rmq

rmq求区间最值。。。

#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
const int N=100005;
int dpmax[N][20],dpmin[N][20];
int main(){int a,b;scanf("%d%d",&a,&b);for(int i=1;i<=a;++i) scanf("%d",&dpmin[i][0]),dpmax[i][0]=dpmin[i][0];
for(int j=1;(1<<j)<=a;++j) for(int i=1;i+(1<<j)-1<=a;++i) dpmin[i][j]=min(dpmin[i][j-1],dpmin[i+(1<<(j-1))][j-1]),
dpmax[i][j]=max(dpmax[i][j-1],dpmax[i+(1<<(j-1))][j-1]);
for(int i=0;i!=b;++i){int n,m;scanf("%d%d",&n,&m);int k=(int)(log(m-n+1.0)/log(2.0));
printf("%d\n",max(dpmax[n][k],dpmax[m+1-(1<<k)][k])-min(dpmin[n][k],dpmin[m+1-(1<<k)][k]));}return 0;
}