记录编号	440222	评测结果	AAAAAAAAAA
题目名称	忠诚	最终得分	100
用户昵称	TARDIS	是否通过	通过
代码语言	C++	运行时间	0.175 s
提交时间	2017-08-22 20:28:27	内存使用	8.32 MiB

#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<iostream>
#define XLM
using namespace std;
const int maxn=1e5+10;
int d[maxn][20],m,n,val[maxn];

void RMQ_init(){
	for (int i=1;i<=n;i++)
		d[i][0]=val[i];
	for (int j=1;(1<<j)<=n;j++){
		for (int i=1;i+(1<<j)-1<=n;i++){
			d[i][j]=min(d[i][j-1],d[i+(1<<(j-1))][j-1]);
		}
	}
}

int main(){
	#ifdef XLM
	freopen("faithful.in","r",stdin);
	freopen("faithful.out","w",stdout);
	#endif
	scanf("%d%d",&n,&m);
	for (int i=1;i<=n;i++){
		scanf("%d",&val[i]);
		d[i][0]=val[i];
	}
	RMQ_init();
	while (m--){
		int l,r,k=0;
		scanf("%d%d",&l,&r);
		while ((1<<(k+1)<=r-l+1)) k++;
		printf("%d ",min(d[l][k],d[r-(1<<k)+1][k]));
	}
	return 0;
}