Nu aveti permisiuni pentru a descarca fisierul grader_test4.in
Cod sursa(job #2974927)
| Utilizator | Data | 4 februarie 2023 20:29:20 | |
|---|---|---|---|
| Problema | Range minimum query | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 1 kb |
#include <bits/stdc++.h>
#define ll int
#define mp make_pair
#define pb push_back
#define Vl vector<ll>
#define Vb vector<bool>
#define nl '\n'
#define pf push_front
#define INF 0x3f3f3f3f
#define pii pair <int, int >
#define pll pair < ll, ll >
#define NMAX 100005
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
ll n, m;
ll rmq[17][NMAX];
ll log2(ll a) {
ll c = 0;
while (a > 1) {
++c;
a /= 2;
}
return c;
}
int main()
{
in >> n >> m;
for (int i = 1; i <= n; i++)
in >> rmq[0][i];
for (int i = 1; (1 << i) <= n; i++) {
for (int j = 1; j <= n; j++) {
rmq[i][j] = min(rmq[i - 1][j + (1 << (i - 1))], rmq[i - 1][j]);
}
}
for (int i = 1; i <= m; i++) {
ll x, y;
in >> x >> y;
ll lg2 = log2(y - x + 1);
ll ans = min(rmq[lg2][x], rmq[lg2][y - (1 << lg2) + 1]);
out << ans << nl;
}
return 0;
}