Cod sursa(job #2702144)
Utilizator | Data | 2 februarie 2021 23:19:24 | |
---|---|---|---|
Problema | Range minimum query | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n, m, rmq[100002][15];
int main()
{
f >> n >> m;
for (int i = 1; i <= n; i++)
f >> rmq[i][0];
for (int i = 1; (1 << i) <= n; i++)
for (int j = 1; j + (1 << i) - 1 <= n; j++)
rmq[j][i] = min(rmq[j][i - 1], rmq[j + (1 << (i - 1))][i - 1]);
for (int x, y, r; m; m--)
{
f >> x >> y;
r = log2(y - x + 1);
g << min(rmq[x][r], rmq[y - (1 << r) + 1][r]) << '\n';
}
return 0;
}