Pagini recente » Cod sursa (job #100569) | Cod sursa (job #669848) | Cod sursa (job #1104864) | Cod sursa (job #275246) | Cod sursa (job #2852852)
#include <fstream>
#include <cstring>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n, m;
int log2[100001], rmq[100001][18];
int main(){
fin>>n>>m;
for(int i=1; i<=n; i++)
fin>>rmq[i][0];
for(int j=1; (1<<j)<=n; j++){
for(int i=1; i+(1<<j)-1<=n; i++)
rmq[i][j]=min(rmq[i][j-1],rmq[i+(1<<(j-1))][j-1]);
}
log2[1]=0;
for(int i=2; i<=n; i++)
log2[i]=log2[i/2]+1;
int x,y,exp;
for( int i=1; i<=m; i++){
fin>>x>>y;
exp=log2[y-x+1];
fout<<min(rmq[x][exp],rmq[y-(1<<exp)+1][exp])<<'\n';
}
return 0;
}