题目描述

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 ≤ 180,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.

每天,农夫 John 的 $n(1\le n\le 5\times 10^4)$ 头牛总是按同一序列排队。

有一天, John 决定让一些牛们玩一场飞盘比赛。他准备找一群在队列中位置连续的牛来进行比赛。但是为了避免水平悬殊，牛的身高不应该相差太大。John 准备了 $q(1\le q\le 1.8\times 10^5)$ 个可能的牛的选择和所有牛的身高 $h_i(1\le h_i\le 10^6,1\le i\le n)$。他想知道每一组里面最高和最低的牛的身高差。

输入格式

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.

第一行两个数 $n,q$。

接下来 $n$ 行，每行一个数 $h_i$。

再接下来 $q$ 行，每行两个整数 $a$ 和 $b$，表示询问第 $a$ 头牛到第 $b$ 头牛里的最高和最低的牛的身高差。

输出格式

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.

输出共 $q$ 行，对于每一组询问，输出每一组中最高和最低的牛的身高差。

样例

样例输入

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

样例输出

6
3
0

数据范围与提示

$1\le n\le 5\times 10^4,1\le q\le 1.8\times 10^5,1\le h_i\le 10^6$

完整代码

#include <bits/stdc++.h>
using namespace std;
inline int read() {int x, sign = 1;char ch;while (true) {ch = getchar();if (ch == '-')sign = -1;if (ch >= '0' && ch <= '9')break;}x = ch - '0';while (true) {ch = getchar();if (ch < '0' || ch > '9')break;x = x * 10 + ch - '0';}return x * sign;
}
int fx[50005][25], fi[50005][25];
int main() {int n, m;n = read(), m = read();for (int i = 1; i <= n; i++) {fx[i][0] = read();fi[i][0] = fx[i][0];}for (int j = 1; j <= 20; j++) {for (int i = 1; i <= n; i++) {if (i + (1 << j) - 1 <= n) {fx[i][j] = max(fx[i][j - 1], fx[i + (1 << (j - 1))][j - 1]);fi[i][j] = min(fi[i][j - 1], fi[i + (1 << (j - 1))][j - 1]);}}}for (int i = 1; i <= m; i++) {int l, r;l = read(), r = read();int k = (int)log2(r - l + 1);int cha = max(fx[l][k], fx[r - (1 << k) + 1][k]) - min(fi[l][k], fi[r - (1 << k) + 1][k]);printf("%d\n", cha);}return 0;
}