Pagini recente » Cod sursa (job #425759) | Cod sursa (job #368335) | Cod sursa (job #3269813) | Cod sursa (job #1603210) | Cod sursa (job #3175886)
#include <fstream>
using namespace std;
const int Nmax = 100005;
const int Log = 18;
int rmq[Log][Nmax];
int logaritm[Nmax];
int main(){
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n, m, x, y, sol, lg;
fin >> n >> m;
for(int i = 0; i < n; i++){
fin >> rmq[0][i];
}
logaritm[1] = 0;
for(int i = 2; i < Nmax; i++){
logaritm[i] = logaritm[i - 1];
if(!(i & (i - 1))){
logaritm[i]++;
}
}
for(int j = 1; (1 << j) <= n; j++){
for(int i = 0; i < n - (1 << j) + 1; i++){
rmq[j][i] = min(rmq[j - 1][i], rmq[j - 1][i + (1 << (j - 1))]);
}
}
for(int i = 0; i < m; i++){
fin >> x >> y;
x--; y--;
lg = logaritm[y - x + 1];
sol = min(rmq[lg][x], rmq[lg][y - (1 << lg) + 1]);
fout << sol << '\n';
}
return 0;
}