Pagini recente » Cod sursa (job #1249384) | Cod sursa (job #2761773) | Cod sursa (job #685682) | Cod sursa (job #2254895) | Cod sursa (job #3263377)
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int n,m;
int rmq[100002][16];
int p2[100002];
void create() {
for (int j=1;(1<<j)<=n;j++) {
for (int i=1;i<=n-(1<<j)+1;i++) {
rmq[i][j] = min(rmq[i][j-1], rmq[i+(1<<(j-1))][j-1]);
}
}
}
int main(){
ifstream in ("rmq.in");
ofstream out ("rmq.out");
in>>n>>m;
for(int i=1;i<=n;i++){
in>>rmq[i][0];
}
p2[1] = 0;
for (int i=2;i<=n;i++) {
p2[i] = p2[i-1];
if ((1<<(p2[i]+1)) <= i) {
p2[i]++;
}
}
create();
for(int i=1;i<=m;i++){
int x,y;
in>>x>>y;
int l=(y-x+1);
out<<min(rmq[x][p2[l]],rmq[y-(1<<p2[l])+1][p2[l]])<<'\n';
}
return 0;
}