[ST表板子]luogu P3865

题目

题目链接：https://www.luogu.com.cn/problem/P3865

代码

#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<cctype>
#include<ctime>
#include<iostream>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<set>
#include<vector>
#include<iomanip>
#include<list>
#include<bitset>
#include<sstream>
#include<fstream>
#include<complex>
#include<algorithm>
#if __cplusplus >= 201103L
#include <unordered_map>
#include <unordered_set>
#endif
#define ll long long
using namespace std;
const int INF = 0x3f3f3f3f;
int dp[100010][30];
inline int read()
{
	int x=0,f=1;char ch=getchar();
	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}
	while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
	return x*f;
}
int main(){
	//ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	int n,m;
	n=read();
	m=read();
	for(int i=1;i<=n;i++) dp[i][0]=read();
	for(int j=1;j<=21;j++){
		for(int i=1;i+(1<<j)-1<=n;i++){
			dp[i][j] = max(dp[i][j-1],dp[i+(1<<(j-1))][j-1]);
		}
	}
	for(int i=1;i<=m;i++){
		int l,r;
		l=read();
		r=read();
		int k=log2(r-l+1);
		int res=max(dp[l][k],dp[r-(1<<k)+1][k]);
		printf("%d\n",res);
	}
    return 0;
}