Cod sursa(job #2532609)
| Utilizator | Data | 27 ianuarie 2020 23:41:29 | |
|---|---|---|---|
| Problema | Range minimum query | Scor | 30 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("rmq.in");
ofstream fout ("rmq.out");
int n, m, minn;
int ii, jj;
int v[100005];
int main (){
fin>>n>>m;
for(int i=1; i<=n; i++) fin>>v[i];
for(int pas=1; pas<=m; pas++){
fin>>ii>>jj;
minn=100005;
for(int i=ii; i <= jj; i++)
minn=min(minn, v[i]);
fout<<minn<<"\n";
}
return 0;
}
