题意
传送门 P2880 [USACO07JAN]Balanced Lineup G
题解
S T ST ST 表求解 R M Q RMQ RMQ 即可,总时间复杂度 O ( N log N + Q ) O(N\log N+Q) O(NlogN+Q)。
#include <bits/stdc++.h>
using namespace std;
const int maxn = 5e4 + 5, maxlg = 16;
int N, Q, H[maxn], lg[maxn], F[maxn][maxlg], G[maxn][maxlg];
int read()
{
int x = 0;
char c = 0;
for (; !isdigit(c); c = getchar())
;
for (; isdigit(c); c = getchar())
x = (x << 1) + (x << 3) + c - '0';
return x;
}
void st_init()
{
for (int i = 0; i < N; ++i)
F[i][0] = G[i][0] = H[i];
for (int j = 1; j <= lg[N]; ++j)
for (int i = 0; i + (1 << j) <= N; ++i)
{
F[i][j] = max(F[i][j - 1], F[i + (1 << (j - 1))][j - 1]);
G[i][j] = min(G[i][j - 1], G[i + (1 << (j - 1))][j - 1]);
}
}
int ask(int l, int r)
{
int k = lg[r - l];
return max(F[l][k], F[r - (1 << k)][k]) - min(G[l][k], G[r - (1 << k)][k]);
}
int main()
{
N = read(), Q = read();
for (int i = 0; i < N; ++i)
H[i] = read();
for (int i = 2; i <= N; ++i)
lg[i] = lg[i >> 1] + 1;
st_init();
while (Q--)
{
int l = read(), r = read();
printf("%d\n", ask(l - 1, r));
}
return 0;
}