额么么么，我太菜了。

#include<bits/stdc++.h>
//我永远喜欢珂朵莉和分块！ 
using namespace std;
#define maxn 1000010
#define int long long
int cnt,n,m,belong[maxn],a[maxn],Min[4500],l[maxn],r[maxn];
int ask(int x,int y){
	int now=0x7f;
    for(register int i=x;i<=min(belong[x]*cnt,y);i++)
	now=min(now,a[i]);
    if(belong[x]!=belong[y]){
		for(register int i=(belong[y]-1)*cnt+1;i<=y;i++)
        now=min(now,a[i]);
	}
    for(register int i=belong[x]+1;i<belong[y];i++)now=min(now,Min[i]);
	return now;
}
signed main(){
	scanf("%lld%lld",&n,&m);
    cnt=sqrt(n);
    memset(Min,0x7f,sizeof(Min));
	for(register int i=1;i<=n;i++){
		scanf("%lld",&a[i]);belong[i]=(i-1)/cnt+1;
        
		Min[belong[i]]=min(Min[belong[i]],a[i]);
	}
	for(register int i=1;i<=m;i++)
    scanf("%lld%lld",&l[i],&r[i]);
	for(register int i=1;i<=m;i++)
    printf("%lld ",ask(l[i],r[i]));
	return 0;
}