Pagini recente » Cod sursa (job #2747235) | Cod sursa (job #2533845) | Cod sursa (job #3285652) | Cod sursa (job #1696228) | Cod sursa (job #3288025)
#include<fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int a[100002][17], vlog[100002];
int n,v[100002];
void Precalc_rmq(){
int i,j,p;
for(i=1;i<=n;i++)
a[0][i]=v[i];
for(p=1;(1<<p) <= n;p++){
for(i=1;i<= n;i++){
a[p][i] = a[p-1][i];
if(i + (1<<(p-1)) <= n)
a[p][i] = min(a[p][i], a[p-1][i+(1<<(p-1))]);
}
}
}
void Precalc_log(){
int i,nr=0;
vlog[1]=0;
for(i=2;i<=100000;i++)
vlog[i]=vlog[i/2]+1;
}
int main(){
int q,st,dr,i,logg,len,j;
Precalc_log();
fin>>n>>q;
for(i=1;i<=n;i++)
fin>>v[i];
Precalc_rmq();
while(q--){
fin>>st>>dr;
logg=vlog[dr-st+1];
len=(1<<logg);
fout<<min(a[logg][st], a[logg][dr-len+1])<<'\n';
}
}