Pagini recente » Cod sursa (job #798475) | Cod sursa (job #533487) | Cod sursa (job #951212) | Cod sursa (job #1958218) | Cod sursa (job #628224)
Cod sursa(job #628224)
#include<cstdio>
#include<fstream>
using namespace std;
int nr[18][100100],log[100100];
inline int min(int a,int b){
return a<b?a:b;
}
int main(){
//freopen("rmq.in","r",stdin);
freopen("rmq.out","w",stdout);
ifstream f("rmq.in");
//ofstream g("rmq.out");
int n,m,i,j,x,y;
//scanf("%d%d",&n,&m);
//scanf("%d",&v[1]);
f>>n>>m;
f>>nr[0][1];
for(i=2;i<=n;++i){
f>>nr[0][i];
log[i]=log[i>>1]+1;
}
for(j=1;(1<<j)<=n+1;++j){
for(i=1;i+(1<<j)<=n+1;++i){
nr[j][i]=min(nr[j-1][i],nr[j-1][i+(1<<(j-1))]);
}
}
for(i=0;i<m;++i){
f>>x>>y;
j=log[y-x+1];
//g<<min(nr[j][x],nr[j][y-(1<<j)+1])<<'\n';
printf("%d\n",min(nr[j][x],nr[j][y-(1<<j)+1]));
}
fclose(stdin);
fclose(stdout);
return 0;
}