Pagini recente » Cod sursa (job #1968953) | Cod sursa (job #3345287) | Cod sursa (job #1278342) | Cod sursa (job #927428) | Cod sursa (job #3306485)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n, m, st, dr, i, j, e;
int r[17][100000], E[100000], v[100000];
int main()
{
fin>>n>>m;
E[1]=0;
for(i=2;i<=n;i++){
//E[i]=1+E[i/2];
E[i]=E[i-1];
if((i&(i-1))==0){
E[i]++;
}
}
for(i=1;i<=n;i++){
fin>>v[i];
r[0][i]=v[i];
}
for(j=1;(1<<j)<=n;j++){
for(i=1;i<=n;i++){
if(i+(1<<(j-1))<=n){
r[j][i]=min(r[j-1][i], r[j-1][i+(1<<(j-1))]);
}else{
r[j][i]=r[j-1][i];
}
//cout<<r[j][i]<<" ";
}
//cout<<'\n';
}
for(i=1;i<=m;i++){
fin>>st>>dr;
e=E[dr-st+1];
//cout<<e<<" ";
int ans=min(r[e][st], r[e][dr-(1<<e)+1]);
fout<<ans<<'\n';
}
return 0;
}