预处理时间O(nlogn),查询时间O(1)
原理可参考https://blog.csdn.net/Hanks_o/article/details/77547380
#include<iostream>
#include<cmath>
#include<cstdio>
using namespace std;
int a[100010];//原始输入数组
int st[100010][20];//st表
void init(int n)
{
for (int i = 0; i < n; i++)
st[i][0] = a[i];
for (int i = 1; (1 << i) <= n; i++)
{
for (int j = 0; j + (1 << i) - 1 < n; j++)
st[j][i] = max(st[j][i - 1],st[j + (1 << (i - 1))][i - 1]);
}
}
int search(int l, int r)
{
int k = (int)(log((double)(r - l + 1)) / log(2.0));
return max(st[l][k],st[r - (1 << k) + 1][k]);
}
int main()
{
int n,m;
cin >> n >> m;
for (int i = 0; i < n; i++)
scanf("%d",&a[i]);
init(n);
while (m--)
{
int l, r;
scanf("%d%d",&l,&r);
printf("%d\n",search(l-1,r-1));
}
return 0;
}