Cod sursa(job #2750261)
| Utilizator | Data | 10 mai 2021 13:48:44 | |
|---|---|---|---|
| Problema | Range minimum query | Scor | 30 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
int main(){
int n, m;
vector < int > numere;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
fin >> n >> m;
for( int i = 0; i < n; i++ ){
int x;
fin >> x;
numere.push_back(x);
}
for( int i = 0; i < m; i++ ){
int stanga, dreapta;
fin >> stanga >> dreapta;
stanga--;
dreapta--;
int minim = numere[stanga];
for( int j = stanga; j <= dreapta; j++ ){
if(numere[j] < minim) minim = numere[j];
}
fout << minim << endl;
}
}
