POJ3264 Balanced Lineup —— 线段树单点更新 区间最大最小值

题目链接：https://vjudge.net/problem/POJ-3264

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.

Input

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.

Output

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.

Sample Input

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

Sample Output

6
3
0

代码如下：

 #include <iostream>
 #include <cstdio>
 #include <cstring>
 #include <cmath>
 #include <algorithm>
 #include <vector>
 #include <queue>
 #include <stack>
 #include <map>
 #include <string>
 #include <set>
 using namespace std;
 typedef long long LL;
 const double EPS = 1e-;
 const int INF = 2e9;
 const LL LNF = 2e18;
 const int MAXN = 5e4+;

 int maxv[MAXN<<], minv[MAXN<<];

 void push_up(int u)
 {
     maxv[u] = max(maxv[u*], maxv[u*+]);
     minv[u] = min(minv[u*], minv[u*+]);
 }

 void add(int u, int l, int r, int x, int val)
 {
     if(l==r)
     {
         maxv[u] = minv[u] = val;
         return;
     }

     int mid = (l+r)>>;
     if(x<=mid) add(u*, l, mid, x, val);
     else add(u*+, mid+, r, x, val);
     push_up(u);
 }

 int maxx, minn;
 void query(int u, int l, int r, int x, int y)
 {
     if(x<=l && r<=y)
     {
         maxx = max(maxx, maxv[u]);
         minn = min(minn, minv[u]);
         return;
     }

     int mid = (l+r)>>;
     if(x<=mid) query(u*, l, mid, x, y);
     if(y>=mid+) query(u*+, mid+, r, x, y);
 }

 int main()
 {
     int n, m;
     while(scanf("%d%d", &n, &m)!=EOF)
     {
         int x, y;
         for(int i = ; i<=n; i++)
         {
             scanf("%d", &x);
             add(, , n, i, x);
         }

         for(int i = ; i<=m; i++)
         {
             scanf("%d%d", &x, &y);
             maxx = -INF, minn = INF;
             query(, , n, x, y);
             printf("%d\n", maxx-minn);
         }
     }
 }