B. balanced lineup

B. balanced lineup Time limit:5000 Ms Case time limit:5000 Ms Memory limit:65536kb 64-bit integer Io format: % LLDJava class name: Main 

For the daily milking, Farmer John'sNCows (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 shocould not differ too much in height.

Farmer John has made a listQ(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.

Inputline 1: two space-separated integers, NAnd 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 AAnd B(1 ≤ A≤ B≤ N), Representing the range of cows from ATo BExtra Sive. outputlines 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 31734251 54 62 2

Sample output

630

Solution: rmq

 1 #include <iostream> 2 #include <cstdio> 3 #include <cstring> 4 #include <cstdlib> 5 #include <vector> 6 #include <climits> 7 #include <algorithm> 8 #include <cmath> 9 #define LL long long10 using namespace std;11 int mn[50010][32],mx[50010][32],d[50010];12 int main(){13     int n,m,x,y,i,j;14     while(~scanf("%d %d",&n,&m)){15         for(i = 0; i < n; i++){16             scanf("%d",d+i);17         }18         memset(mn,0,sizeof(mn));19         memset(mx,0,sizeof(mx));20         for(i = n-1; i >= 0; i--){21             mn[i][0] = mx[i][0] = d[i];22             for(j = 1; i+(1<<j)-1 < n; j++){23                 mn[i][j] = min(mn[i][j-1],mn[i+(1<<(j-1))][j-1]);24                 mx[i][j] = max(mx[i][j-1],mx[i+(1<<(j-1))][j-1]);25             }26         }27         for(i = 0; i < m; i++){28             scanf("%d %d",&x,&y);29             if(x > y) swap(x,y);30             int r = y - x + 1;31             r = log2(r);32             int theMax,theMin;33             theMax = max(mx[x-1][r],mx[y-(1<<r)][r]);34             theMin = min(mn[x-1][r],mn[y-(1<<r)][r]);35             printf("%d\n",theMax-theMin);36         }37     }38     return 0;39 }

View code