Cod sursa(job #2775959)
Utilizator | Stroescu Matei Alexandru gripz | Data | 18 septembrie 2021 12:21:06 |
---|---|---|---|
Problema | Range minimum query | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
#include <climits>
using namespace std;
int N, M;
int v[100001];
int x, y;
int main() {
freopen("rmq.in", "r", stdin);
freopen("rmq.out", "w", stdout);
cin >> N >> M;
for(int i = 1; i <= N; i++) {
cin >> v[i];
}
for(int i = 1; i <= M; i++) {
cin >> x >> y;
int minim = INT_MAX;
for(int j = x; j <= y; j++) {
minim = min(v[j], minim);
}
cout << minim << endl;
}
}