【bzoj1636】[Usaco2007 Jan]Balanced Lineup

2014年5月23日1,7403

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

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

Sample Input

* 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 Output

6
3
0

题解

裸RMQ

 

  • 刘丁洢2016年4月16日 上午10:02 回复

    inline int read()
    {
    int x=0;char ch=getchar();
    while(ch’9′)ch=getchar();
    while(ch>=’0’&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x;
    }求解释

    #1  
    • GuaAugust2016年4月16日 下午8:15 回复

      读入优化……

      #11