Luogu 3865（st表）

传送门

模板题，就怕某些毒瘤出题人卡线段树。

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int N=1e5+4;
int n,q;
int mx[18][N],lg[N]={0,0};
inline int read() {
	int x=0;char c=getchar();
	while (c<'0'||c>'9') c=getchar();
	while (c>='0'&&c<='9') x=(x<<3)+(x<<1)+c-'0',c=getchar();
	return x;
}
inline void init() {
	mx[0][1]=read();
	for (register int i=2;i<=n;++i) mx[0][i]=read(),lg[i]=lg[i>>1]+1;
	for (int j=1;(1<<j)<=n;++j)
		for (register int i=1;i+(1<<j)-1<=n;++i)
			mx[j][i]=max(mx[j-1][i],mx[j-1][i+(1<<(j-1))]);
}
inline int rmq(int x,int y) {
	int t=lg[y-x+1];
	return max(mx[t][x],mx[t][y-(1<<t)+1]);
}
int main() {
//	freopen("P3865.in","r",stdin);
	n=read(),q=read();
	init();
	for (register int i=0;i<q;++i) {
		int l=read(),r=read();
		printf("%d\n",rmq(l,r));
	}
	return 0;
}