Pagini recente » Cod sursa (job #2835348) | Cod sursa (job #1477955) | Cod sursa (job #1708795) | Cod sursa (job #166438) | Cod sursa (job #2625638)
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
fstream fin("rmq.in", ios::in);
fstream fout("rmq.out", ios::out);
long int rmq[18][100002], a[100002];
int main() {
long int n, m;
fin >> n >> m;
for (long int i = 1; i <= n; i++)
fin >> a[i];
for (long int i = 1; i <= n; i++)
rmq[0][i] = a[i];
for (long int i = 1; (1 << i) <= n; i++)
for (long int j = 1; j <= n - (1 << i) + 1; j++)
{
long int l = 1 << (i - 1);
rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + l]);
}
long int x, y, d;
for (long int i = 1; i <= m; i++) {
fin >> x >> y;
d = y - x + 1;
long int l = (int)log2(d);
d = d - (1 << l);
fout << min(rmq[l][x], rmq[l][x + d]) << "\n";
}
return 0;
}