poj3264

区间求最大最小值问题，可以用RMQ算法。

#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<time.h>
#include<queue>
#include<stack>
#include<iterator>
#include<math.h>
#include<stdlib.h>
#include<limits.h>
#include<map>
#include<set>
#include<bitset>
//#define ONLINE_JUDGE
#define eps 1e-8
#define INF 0x7fffffff
#define FOR(i,a) for((i)=0;i<(a);(i)++)
#define MEM(a) (memset((a),0,sizeof(a)))
#define sfs(a) scanf("%s",a)
#define sf(a) scanf("%d",&a)
#define sfI(a) scanf("%I64d",&a)
#define pf(a) printf("%d\n",a)
#define pfI(a) printf("%I64d\n",a)
#define pfs(a) printf("%s\n",a)
#define sfd(a,b) scanf("%d%d",&a,&b)
#define sft(a,b,num) scanf("%d%d%d",&a,&b,&num)
#define for1(i,a,b) for(int i=(a);i<b;i++)
#define for2(i,a,b) for(int i=(a);i<=b;i++)
#define for3(i,a,b)for(int i=(b);i>=a;i--)
#define MEM1(a) memset(a,0,sizeof(a))
#define MEM2(a) memset(a,-1,sizeof(a))
#define ll long long
const double PI = acos(-1.0);
template<class T> T gcd(T a, T b) {
    return b ? gcd(b, a % b) : a;}
template<class T> T lcm(T a, T b) {
    return a / gcd(a, b) * b;}
template<class T> inline T Min(T a, T b) {
    return a < b ? a : b;}
template<class T> inline T Max(T a, T b) {
    return a > b ? a : b;}
using namespace std;
#define M 50010
int n,m,k;
int dp1[M][20];
int dp2[M][20];
int a[M];
void Init(){
    memset(dp1,0,sizeof dp1);
    memset(dp2,0,sizeof dp2);
    for(int i=0;i<n;i++) dp1[i][0] = a[i],dp2[i][0] = a[i];
    for(int j=1;(1<<j)<=n;j++){
        for(int i=0;i+(1<<j)-1<=n;i++){
            dp1[i][j] = Max(dp1[i][j-1],dp1[i+(1<<(j-1))][j-1]);
            dp2[i][j] = Min(dp2[i][j-1],dp2[i+(1<<(j-1))][j-1]);
        }
    }
}
int RMQ_Max(int L,int R){
    int k=(int)log2(R-L+1);
//  while((1<<(k+1))<=R-L+1) k++;
    return Max(dp1[L][k],dp1[R-(1<<k)+1][k]);
}
int RMQ_Min(int L,int R){
    int k=(int)log2(R-L+1);
//  while((1<<(k+1))<=R-L+1) k++;
    return Min(dp2[L][k],dp2[R-(1<<k)+1][k]);
}
int main() {
#ifndef ONLINE_JUDGE
    freopen("in.txt", "r", stdin);
//      freopen("out.txt", "w", stdout);
#endif
    int q;
    while(sfd(n,q)!=EOF){
        for(int i=0;i<n;i++)
            sf(a[i]);
        Init();
        int L,R;
        for(int i=0;i<q;i++){
            scanf("%d%d",&L,&R);
            L--,R--;
            int mmax = RMQ_Max(L,R);
            int mmin = RMQ_Min(L,R);
            printf("%d\n",mmax-mmin);
        }
    }
    return 0;
}

当然，我们也可以用线段树做，用mmax和mmin来维护们每个节点的最大最小值。

#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<time.h>
#include<queue>
#include<stack>
#include<iterator>
#include<math.h>
#include<stdlib.h>
#include<limits.h>
#include<map>
#include<set>
#include<bitset>
//#define ONLINE_JUDGE
#define eps 1e-8
#define INF 0x7fffffff
#define FOR(i,a) for((i)=0;i<(a);(i)++)
#define MEM(a) (memset((a),0,sizeof(a)))
#define sfs(a) scanf("%s",a)
#define sf(a) scanf("%d",&a)
#define sfI(a) scanf("%I64d",&a)
#define pf(a) printf("%d\n",a)
#define pfI(a) printf("%I64d\n",a)
#define pfs(a) printf("%s\n",a)
#define sfd(a,b) scanf("%d%d",&a,&b)
#define sft(a,b,num) scanf("%d%d%d",&a,&b,&num)
#define for1(i,a,b) for(int i=(a);i<b;i++)
#define for2(i,a,b) for(int i=(a);i<=b;i++)
#define for3(i,a,b)for(int i=(b);i>=a;i--)
#define MEM1(a) memset(a,0,sizeof(a))
#define MEM2(a) memset(a,-1,sizeof(a))
#define ll long long
const double PI = acos(-1.0);
template<class T> T gcd(T a, T b) {
    return b ? gcd(b, a % b) : a;}
template<class T> T lcm(T a, T b) {
    return a / gcd(a, b) * b;}
template<class T> inline T Min(T a, T b) {
    return a < b ? a : b;}
template<class T> inline T Max(T a, T b) {
    return a > b ? a : b;}
using namespace std;
#define M 50010
int n,m,k;
int a[M];
int asmmax,asmmin;
struct Node{
    int lf,rt;
    int mmax,mmin;
}tree[M<<2];
void Build(int p,int s,int e){
    tree[p].lf = s;
    tree[p].rt = e;
    if(tree[p].lf == tree[p].rt){
        tree[p].mmax = tree[p].mmin = a[s];
        return;
    }
    int mid = (s+e)>>1;
    Build(p<<1,s,mid);
    Build(p<<1|1,mid+1,e);
    tree[p].mmax = Max(tree[p<<1].mmax,tree[p<<1|1].mmax);  //维护一个区间的最大最小值
    tree[p].mmin = Min(tree[p<<1].mmin,tree[p<<1|1].mmin);
}
void Query(int p,int L,int R){
    if(tree[p].lf == L && tree[p].rt == R){
        asmmin = Min(asmmin,tree[p].mmin);
        asmmax = Max(asmmax,tree[p].mmax);
        return;
    }
    int mid = (tree[p].lf+tree[p].rt)>>1;
    if(R<=mid)
        Query(p<<1,L,R);
    else if(L>mid)
        Query(p<<1|1,L,R);
    else{
        Query(p<<1,L,mid);
        Query(p<<1|1,mid+1,R);
    }
}
int main() {
#ifndef ONLINE_JUDGE
    freopen("in.txt", "r", stdin);
//      freopen("out.txt", "w", stdout);
#endif
    int q;
    while(sfd(n,q)!=EOF){
        for(int i=0;i<n;i++)
            sf(a[i]);
        Build(1,0,n-1);     //构造线段树
        int L,R;
        for(int i=0;i<q;i++){
            scanf("%d%d",&L,&R);
            L--,R--;
            asmmax = -INF;
            asmmin = INF;
            Query(1,L,R);
            printf("%d\n",asmmax-asmmin);
        }
    }
    return 0;
}