Pagini recente » Cod sursa (job #2785180) | Cod sursa (job #698139) | Cod sursa (job #1461172) | Cod sursa (job #2440630) | Cod sursa (job #2886740)
#include <fstream>
#include <cmath>
using namespace std;
ifstream cin("rmq.in");
ofstream cout("rmq.out");
const int NMAX = 1e5;
int rmq[int(1 + log2(NMAX))][NMAX], v[NMAX], logaritm[NMAX], n, q, x, y;
int main(){
cin >> n >> q;
for(int i = 1; i <= n; i++)
cin >> rmq[0][i];
logaritm[1] = 0;
for(int i = 2; i <= n; i++)
logaritm[i] = 1 + logaritm[i / 2];
int lim = log2(n);
for(int i = 1; i <= lim; i++)
for(int j = (1 << i); j <= n; j++)
rmq[i][j] = min(rmq[i - 1][j - (1 << (i - 1))], rmq[i - 1][j]);
for(int i = 0; i < q; i++){
cin >> x >> y;
int l = logaritm[y - x + 1];
cout << min(rmq[l][x + (1 << l) - 1], rmq[l][y]) << "\n";
}
return 0;
}