Balanced Lineup POJ - 3264 [线段树]

Balanced Lineup Time Limit: 5000MS   Memory Limit: 65536K Total Submissions: 60851   Accepted: 28470 Case Time Limit: 2000MS Description 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 Source USACO 2007 January Silver

线段树练习题目。。。

/*
题意：给定n个数，查询一个区间内的最大值与最小值之差。。。
*/

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int maxn = 5e4+7;
int INF = 1e7;
int n, q, s[maxn], nMax, nMin;


struct node {
    int l, r;
    int nMin, nMax;
}segTree[maxn*10];

void Build(int i, int l, int r)
{
    segTree[i].l = l;
    segTree[i].r = r;
    if(l == r) {
        segTree[i].nMin = segTree[i].nMax = s[l];
        return ;
    }
    int mid = (l+r)>>1;
    Build(i<<1, l, mid);
    Build(i<<1|1, mid+1, r);
    segTree[i].nMin = min(segTree[i<<1].nMin, segTree[i<<1|1].nMin);
    segTree[i].nMax = max(segTree[i<<1].nMax, segTree[i<<1|1].nMax);
    //左子树和右子树;
}

void Query(int i, int l, int r)
{
    if(segTree[i].nMax<=nMax&&segTree[i].nMin>= nMin) return ;
    if(segTree[i].l == l&&segTree[i].r == r) {
        nMax = max(segTree[i].nMax, nMax);
        nMin = min(segTree[i].nMin, nMin);
        return ;
    }
    int mid = (segTree[i].l+segTree[i].r)>>1;
    if(r <= mid) Query(i<<1, l, r);
    else if(l>mid) Query(i<<1|1, l, r);
    else {
        Query(i<<1, l, mid);
        Query(i<<1|1, mid+1, r);
    }
}

int main()
{
    int i, j, a, b;
    //freopen("in.txt", "r", stdin);
    while(~scanf("%d%d",&n,&q))
    {
        for(i = 1; i <= n; i++) scanf("%d",&s[i]);
        Build(1, 1, n);
        for(i = 0; i < q; i++)
        {
            scanf("%d%d",&a,&b);
            nMax = -INF; nMin = INF;
            Query(1, a, b);
            printf("%d\n",nMax - nMin);
        }
    }
    return 0;
}