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
(RMQ:参考博客https://blog.csdn.net/y990041769/article/details/38405063)
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
using namespace std;
const int maxn=5e4+10;
int a[maxn];
int ta[maxn][25],sh[maxn][25];
//ta[i][j]:表示在i~i+2^j-1这个区间里的最大值
//sh[i][j]:表示在i~i+2^j-1这个区间里的最小值
int n;
int RMQ(int l,int r)
{
int len=r-l+1,k=0;
//求交叉区间的最大值
while((1<<(k+1))<=len)
k++;
//两个区间有交叉
int maxx=max(ta[l][k],ta[r-(1<<k)+1][k]);
int minn=min(sh[l][k],sh[r-(1<<k)+1][k]);
return maxx-minn;
}
int main(void)
{
int q;
scanf("%d%d",&n,&q);
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
ta[i][0]=sh[i][0]=a[i];
}
//把i~2^j-1,这个区间分为i~i+2^(j-1)-1和i+2^(j-1)~i+2^j-1两个区间更新。
for(int j=1;(1<<j)<=n;j++)
for(int i=1;i+(1<<j)-1<=n;i++)
{
ta[i][j]=max(ta[i][j-1],ta[i+(1<<(j-1))][j-1]);
sh[i][j]=min(sh[i][j-1],sh[i+(1<<(j-1))][j-1]);
}
while(q--)
{
int l,r;
scanf("%d%d",&l,&r);
printf("%d\n",RMQ(l,r));
}
return 0;
}