Cod sursa(job #3253690)
| Utilizator | Data | 4 noiembrie 2024 11:59:29 | |
|---|---|---|---|
| Problema | Range minimum query | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <bits/stdc++.h>
using namespace std;
int v[100005];
int m[100005][19];
int main()
{
int n, q;
cin >> n >> q;
for(int i = 1; i <= n; i++){
cin >> v[i];
m[i][0] = v[i];
}
for(int j = 1; j <= log2(n); j++){
for(int i = 1; i <= n - (1<<j) + 1; i++){
m[i][j] = min(m[i][j-1], m[i+(1<<(j-1))][j-1]);
}
}
int a, b;
for(int i = 1; i <= q; i++){
cin >> a >> b;
int x = log2(b - a + 1);
cout << min(m[a][x], m[b-(1<<x) + 1][x]) << '\n';
}
return 0;
}
