POJ 3264 - Balanced Lineup（线段树）

最新推荐文章于 2014-01-14 00:01:47 发布

coco430

最新推荐文章于 2014-01-14 00:01:47 发布

阅读量482

点赞数

分类专栏：数据结构 POJ

本文链接：https://blog.csdn.net/coco430/article/details/12290965

版权

POJ 同时被 2 个专栏收录

23 篇文章 0 订阅

订阅专栏

数据结构

5 篇文章 0 订阅

订阅专栏

Farmer John决定组织一场牛群的飞盘比赛，为了确保所有牛都能享受到乐趣，他需要确保牛群中个体间的身高差距不会太大。他提供了一系列可能的牛群组合及其高度，并请求助手确定每组中最高与最矮牛的身高差。

摘要由CSDN通过智能技术生成

Balanced Lineup

Time Limit: 5000MS		Memory Limit: 65536K
Total Submissions: 29686		Accepted: 14001
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

Sample Output

6
3
0

===========================

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#define N 222222

using namespace std;

int num[N],MAX,MIN;

struct Tree
{
    int l;
    int r;
    int max;
    int min;
} tree[N*4];

void push_up(int root)
{
    tree[root].max=max(tree[root<<1].max,tree[root<<1|1].max);
    tree[root].min=min(tree[root<<1].min,tree[root<<1|1].min);
}

void build(int root,int l,int r)
{
    tree[root].l=l;
    tree[root].r=r;
    if(tree[root].l==tree[root].r)
    {
        tree[root].max=num[l];
        tree[root].min=num[l];
        return;
    }
    int mid=(l+r)/2;
    build(root<<1,l,mid);
    build(root<<1|1,mid+1,r);
    push_up(root);
}

void update(int root,int pos,int val)
{
    if(tree[root].l==tree[root].r)
    {
        tree[root].max=val;
        tree[root].min=val;
        return;
    }
    int mid=(tree[root].l+ tree[root].r)/2;
    if(pos<=mid)
        update(root<<1,pos,val);
    else
        update(root<<1|1,pos,val);
    push_up(root);
}

void query(int root,int L,int R,Tree tree[])
{
    if(L<=tree[root].l&&R>=tree[root].r)
    {
        MIN=min(MIN,tree[root].min);
        MAX=max(MAX,tree[root].max);
        return;
    }
    int mid=(tree[root].l+tree[root].r)/2;
    if(L<=mid) query(root<<1,L,R,tree);
    if(R>mid) query(root<<1|1,L,R,tree);
}

int main()
{
    int n,q,a,b;
    scanf("%d%d",&n,&q);
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&num[i]);
    }
    build(1,1,n);
    for(int i=0;i<q;i++)
    {
        scanf("%d%d",&a,&b);
        MAX=-1;MIN=1e9;
        query(1,a,b,tree);
        printf("%d\n",MAX-MIN);
    }
    return 0;
}