Balanced Lineup

For the daily milking, Farmer John's N cows (1 ≤ N ≤ 50,000) always line up in the same order. One day Farmer John decides to organize a game of Ultimate Frisbee with some of the cows. To keep things simple, he will take a contiguous range of cows from the milking lineup to play the game. However, for all the cows to have fun they should not differ too much in height.

Farmer John has made a list of Q (1 ≤ Q ≤ 200,000) potential groups of cows and their heights (1 ≤ height ≤ 1,000,000). For each group, he wants your help to determine the difference in height between the shortest and the tallest cow in the group.

Line 1: Two space-separated integers,  N and  Q. 
Lines 2.. N+1: Line  i+1 contains a single integer that is the height of cow  i 
Lines  N+2.. N+ Q+1: Two integers  A and  B (1 ≤  A ≤  B ≤  N), representing the range of cows from  A to  B inclusive.

Lines 1.. Q: Each line contains a single integer that is a response to a reply and indicates the difference in height between the tallest and shortest cow in the range.

6 3
1
7
3
4
2
5
1 5
4 6
2 2

6
3
0

USACO 2007 January Silver

/***
    题目大意： 
    给出一组数组，求某区间的最大值与最小值的差。
    
    维护线段树的两个值，使用全局变量记录最大值和最小值和结果
***/
#include <map>
#include <set>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <vector>
#include <bitset>
#include <cstdio>
#include <string>
#include <numeric>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <functional>
using namespace std;
typedef long long  ll;
typedef unsigned long long ull;

int dx[4]= {-1,1,0,0};
int dy[4]= {0,0,-1,1}; //up down left right
bool inmap(int x,int y,int n,int m)
{
    if(x<1||x>n||y<1||y>m)return false;
    return true;
}
int hashmap(int x,int y,int m)
{
    return (x-1)*m+y;
}

#define eps 1e-8
#define inf 0x7fffffff
#define debug puts("BUG")
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define read freopen("in.txt","r",stdin)
#define write freopen("out.txt","w",stdout)
#define Mem(x,y) memset((a),(x),sizeof(a))
#define maxn 50005

struct Node
{
    int mn;//区间最大值
    int mx;//区间最小值
} node[maxn<<2];
int ans;
int maxs;//当前最大值
int mins;//当前最小值

void init()//每一次使用全局变量时进行初始化
{
     ans=0;
     maxs=0;
     mins=inf-1;
}

void PushUp(int rt)//更新结点
{
    node[rt].mx=max(node[rt<<1].mx,node[rt<<1|1].mx);
    node[rt].mn=min(node[rt<<1].mn,node[rt<<1|1].mn);
}

void build(int l,int r,int rt)//建立线段树
{
    if(l==r)//结点
    {
        scanf("%d",&node[rt].mx);
        node[rt].mn=node[rt].mx;
        return ;
    }
    int m=(l+r)>>1;
    build(lson);
    build(rson);
    PushUp(rt);
}

void query(int L,int R,int l,int r,int rt)//只需要进行一次查询即可,因为是同区间的查询
{
    if(L<=l&&r<=R)
    {
        ans=max(ans,node[rt].mx-node[rt].mn);//记录ans
        maxs=max(node[rt].mx,maxs);//记录最大值
        mins=min(node[rt].mn,mins);//记录最小值
        return ;
    }
    int m=(l+r)>>1;
    if(L<=m)
        query(L,R,lson);
    if(m<R)
        query(L,R,rson);
    ans=max(ans,maxs-mins);//记录ans
}

int main()
{
    int n,m;
    while(~scanf("%d%d",&n,&m))
    {
        build(1,n,1);
        for(int i=0; i<m; i++)
        {
            init();
            int L,R;
            scanf("%d%d",&L,&R);
            query(L,R,1,n,1);
            printf("%d\n",ans);
        }
    }
    return 0;
}