Pagini recente » Cod sursa (job #603762) | Cod sursa (job #1771190) | Cod sursa (job #2489521) | Cod sursa (job #2398781) | Cod sursa (job #2499931)
#include <cstdio>
#include <iostream>
using namespace std;
//ifstream fin("rmq.in");
//ofstream fout("rmq.out");
FILE * fin=fopen("rmq.in", "r");
FILE * fout=fopen("rmq.out", "w");
int n,m,i,j,p,v[20][100001];
char buff[100000];
int pp;
int numar(){
int val=0;
while(!(buff[pp]>='0' && buff[pp]<='9')){
pp++;
if(pp==100000){
fread(buff,1,100000,fin);
pp=0;
}
}
while(buff[pp]>='0' && buff[pp]<='9'){
val=val*10+buff[pp]-'0';
pp++;
if(pp==100000){
fread(buff,1,100000,fin);
pp=0;
}
}
return val;
}
int main(){
n=numar();
m=numar();
///cout<<n<<"\n";
for(i=1;i<=n;i++){
v[0][i]=numar();
}
for(i=1;(1<<i)<=n;i++){
for(j=1;j<=n;j++){
v[i][j]=v[i-1][j];
if(j+(1<<(i-1))<=n)
v[i][j]=min(v[i][j],v[i-1][j+(1<<(i-1))]);
}
}
for(;m;m--){
i=numar();
j=numar();
p=0;
while((1<<p)<=j-i+1)
p++;
p--;
fprintf(fout,"%d\n",min(v[p][i],v[p][j-(1<<p)+1]));
///fprintf(fout,"\n");
}
return 0;
}