TOJ1698: Balanced Lineup

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 January 2007

输出区间最大最小值之差，RMQ

#include<bits/stdc++.h>
using namespace std;
const int N=;
int dmi[N][],dma[N][],f[N];
int n,q,l,r;
void RMQ_init()
{
    for(int j=; (<<j)<=n; j++)
        for(int i=; i+j-<=n; i++)
            dmi[i][j]=min(dmi[i][j-],dmi[i+(<<(j-))][j-]),dma[i][j]=max(dma[i][j-],dma[i+(<<(j-))][j-]);
}
int RMQ(int l,int r)
{
    int k=f[r-l+];
    return max(dma[l][k],dma[r-(<<k)+][k])-min(dmi[l][k],dmi[r-(<<k)+][k]);
}
int main()
{
    f[]=-;
    scanf("%d%d",&n,&q);
    for(int i=; i<=n; i++)
        scanf("%d",&dma[i][]),dmi[i][]=dma[i][],f[i]=((i&(i-))==)?f[i-]+:f[i-];
    RMQ_init();
    while(q--)
    {
        scanf("%d%d",&l,&r);
        printf("%d\n",RMQ(l,r));
    }
    return ;
}

线段树

#include<bits/stdc++.h>
using namespace std;
#define lson l,mi,rt<<1
#define rson mi+1,r,rt<<1|1
struct T
{
    int ma,mi,l,r;
}tree[];
int h[];
int ma,mi;
void build(int l,int r,int rt)
{
    tree[rt].l=l,tree[rt].r=r;
    if(l==r)
    {
        tree[rt].ma=tree[rt].mi=h[l];
        return;
    }
    int mi=(l+r)>>;
    build(lson);
    build(rson);
    tree[rt].ma=max(tree[rt<<].ma,tree[rt<<|].ma);
    tree[rt].mi=min(tree[rt<<].mi,tree[rt<<|].mi);
}
void findma(int l,int r,int rt)
{
    if(tree[rt].l==l&&tree[rt].r==r)
    {
        if(tree[rt].ma>ma)ma=tree[rt].ma;
        return;
    }
    int mi=(tree[rt].l+tree[rt].r)>>;
    if(mi>=r)
        findma(l,r,rt<<);
    else if(mi<l)
        findma(l,r,rt<<|);
    else
        findma(lson),findma(rson);
}

void findmi(int l,int r,int rt)
{
    if(tree[rt].l==l&&tree[rt].r==r)
    {
        if(tree[rt].mi<mi)mi=tree[rt].mi;
        return;
    }
    int mi=(tree[rt].l+tree[rt].r)>>;
    if(mi>=r)
        findmi(l,r,rt<<);
    else if(mi<l)
        findmi(l,r,rt<<|);
    else
        findmi(lson),findmi(rson);
}
int main()
{
    int n,q,i,a,b;
    scanf("%d%d",&n,&q);
    for(i=;i<=n;i++)
        scanf("%d",&h[i]);
    build(,n,);
    while(q--)
    {
        ma=;
        mi=1e9;
        scanf("%d%d",&a,&b);
        findma(a,b,),findmi(a,b,);
        printf("%d\n",ma-mi);
    }
    return ;
}