Pagini recente » Cod sursa (job #2831412) | Cod sursa (job #2700958) | Cod sursa (job #2120459) | Cod sursa (job #1005012) | Cod sursa (job #2382774)
#include <bits/stdc++.h>
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
int v[100001], rmq[19][19], lg[100001];
int n, q;
int main()
{
int a, b;
in >> n >> q;
for (int i = 1; i <= n; ++i)
in >> v[i];
lg[1] = 0;
for (int i = 2; i <= n; ++i)
lg[i] = lg[i / 2] + 1;
for (int i = 1; i <= n; ++i)
rmq[0][i] = v[i];
int l;
for (int i = 1; (1 << i) <= n; ++i)
{
for (int j = 1; j <= n - (1 << i) + 1; ++j)
{
l = 1 << (i - 1);
rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + l]);
}
}
int x, y, diff, sh;
for (int i = 1; i <= q; ++i)
{
in >> x >> y;
diff = y - x + 1;
l = lg[diff];
sh = diff - (1 << l);
out << min(rmq[l][x], rmq[l][x + sh]) << '\n';
}
return 0;
}