Time Limit: 5000MS | Memory Limit: 65536K | |
Total Submissions: 56914 | Accepted: 26673 | |
Case Time Limit: 2000MS |
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
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
Sample Input
6 3 1 7 3 4 2 5 1 5 4 6 2 2
Sample Output
6 3 0
Source
#include <cstdio>
#include <algorithm>
#include<cstring>
using namespace std;
#define lson l , m , rt << 1
#define rson m + 1 , r , rt << 1 | 1
const int maxn = 50010;
const int INF = 0x3f3f3f3f;
int MAX[maxn << 2];
int MIN[maxn << 2];
int pos;
//区间最大值
void PushUP1(int rt) {
MAX[rt] = max(MAX[rt << 1], MAX[rt << 1 | 1]);
}
void build1(int l, int r, int rt) {
if (l == r) {
scanf("%d", &MAX[rt]);
MIN[rt] = MAX[rt];
return;
}
int m = (l + r) >> 1;
build1(lson);
build1(rson);
PushUP1(rt);
}
void update1(int p, int sc, int l, int r, int rt) {
if (l == r) {
MAX[rt] = sc;
return;
}
int m = (l + r) >> 1;
if (p <= m) update1(p, sc, lson);
else update1(p, sc, rson);
PushUP1(rt);
}
int query1(int L, int R, int l, int r, int rt) {
if (L <= l && r <= R) {
return MAX[rt];
}
int m = (l + r) >> 1;
int ret = -maxn;
if (L <= m) ret = max(ret, query1(L, R, lson));
if (R > m) ret = max(ret, query1(L, R, rson));
return ret;
}
//区间最小值
void PushUP2(int rt) {
MIN[rt] = min(MIN[rt << 1], MIN[rt << 1 | 1]);
}
void build2(int l, int r, int rt) {
if (l == r) {
return;
}
int m = (l + r) >> 1;
build2(lson);
build2(rson);
PushUP2(rt);
}
void update2(int p, int sc, int l, int r, int rt) {
if (l == r) {
MIN[rt] = sc;
return;
}
int m = (l + r) >> 1;
if (p <= m) update2(p, sc, lson);
else update2(p, sc, rson);
PushUP2(rt);
}
int query2(int L, int R, int l, int r, int rt) {
if (L <= l && r <= R) {
return MIN[rt];
}
int m = (l + r) >> 1;
int ret = INF;
if (L <= m) ret = min(ret, query2(L, R, lson));
if (R > m) ret = min(ret, query2(L, R, rson));
return ret;
}
int main()
{
int n,q;
while(scanf("%d%d", &n,&q)!=EOF)
{
memset(MAX, 0, sizeof(MAX));
fill(MIN, MIN + maxn, INF);
build1(1, n, 1);
build2(1, n, 1);
while (q--)
{
int a, b;
scanf("%d%d", &a, &b);
printf("%d\n", query1(a, b, 1, n, 1) - query2(a, b, 1, n, 1));
}
}
return 0;
}