RMQ算法,计算区间最值,nlogn预处理O(1)回答
b[i][j]表示从下标i开始2^j个元素的最值。
#include<bits/stdc++.h>
using namespace std;
#define PER(i,a,b) for(int i=a;i<=b;i++)
int n,a[100001],q,l,r;
int b[100001][21];
int main()
{
scanf("%d",&n);
PER(i,1,n) scanf("%d",&a[i]);
PER(i,1,n) b[i][0]=a[i];
PER(j,1,int(log(n)/log(2.0)))
PER(i,1,n)
{
b[i][j]=max(b[i-1][j-1],b[i+1<<(j-1)][j-1]);
}
scanf("%d",&q);
while(q--)
{
scanf("%d%d",&l,&r);
int gj=log(r-l+1)/log(2.0);
cout<<max(b[l][gj],b[r-1<<(gj)+1][gj])<<endl;
}
}