Pagini recente » Cod sursa (job #245399) | Cod sursa (job #2220399) | Cod sursa (job #1811399) | Cod sursa (job #2718314) | Cod sursa (job #3133722)
#include <iostream>
#include <fstream>
#include <cmath>
std::ifstream fin("rmq.in");
std::ofstream fout("rmq.out");
int main()
{
int n, m;
fin >> n >> m;
int size_log = int(log(n));
int v[n + 5], preprocesare[n + 5][size_log + 5];
for(int i = 0; i < n; i++){
fin >> v[i];
preprocesare[i][0] = v[i];
}
for(int j = 1; j <= size_log; j++){
for(int i = 0; i + (1 << j) - 1 <= n; i++)
preprocesare[i][j] = std::min(preprocesare[i][j - 1], preprocesare[i + (1 << (j - 1))][j - 1]);
}
int a, b;
for(int i = 0; i < m; i++){
fin >> a >> b;
a--;
b--;
int lung = b - a + 1;
int range = int(log(lung));
fout << std::min(preprocesare[a][range], preprocesare[b - (1<<range)+ 1][range]) << std::endl;
}
return 0;
}