题目
解析
直接使用线段树或RMQ模版即可
#include <iostream>
#include <cstdlib>
#include <string>
#include <cstring>
#include <vector>
#include <algorithm>
#include <queue>
#include <functional>
#include <unordered_set>
#include <set>
#include <bitset>
#include <cstdio>
using namespace std;
const int logn = 21; //log n
const int maxn = 2*100000 + 10;
int a[maxn], f[maxn][logn], Logn[maxn];
int n, m; //n个元素,m次查询
inline int read()
{
char c=getchar();int x=0,f=1;
while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}
return x*f;
}
void pre()
{
Logn[1] = 0;
Logn[2] = 1;
for(int i = 3;i < maxn;i++) Logn[i] = Logn[i/2] + 1;
}
void RMQ_init()
{
pre();
for(int j = 1;j <= logn;j++)
for(int i = 1;i + (1 << j) - 1 <= n;i++)
f[i][j] = max(f[i][j-1], f[i + (1 << (j-1))][j-1]);
}
int RMQ(int L, int R)
{
int s = Logn[R - L + 1];
return max(f[L][s], f[R - (1 << s) + 1][s]);
}
int main()
{
n = read();
for(int i = 1;i <= n;i++) f[i][0] = read();
RMQ_init();
m = read();
for(int i = 0;i < m;i++)
{
int x, y;
x = read(); y = read();
printf("%d\n", RMQ(x, y));
}
return 0;
}