JZOJ 1370 飞船#RMQ#

RMQ

#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
int f[100001][21],n,m;
int main(){
	scanf("%d%d",&n,&m);
	for (int i=1;i<=n;i++) scanf("%d",&f[i][0]);
	for (int j=1;(1<<j)<=n;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]);//状态转移方程
	for (int i=1;i<=m;i++){
		int l,r,z;
		scanf("%d%d",&l,&r);
		z=(int)(log(r-l+1)/log(2));
		printf("%d\n",max(f[l][z],f[r+1-(1<<z)][z]));
	}
	return 0;
}