Cod sursa(job #3001577)
| Utilizator | Data | 13 martie 2023 19:27:23 | |
|---|---|---|---|
| Problema | Range minimum query | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
constexpr int N = 100000;
int v[N];
int main()
{
/** Brute Force **/
int n, M, r, l;
fin >> n >> M;
for(int i=0; i<n; ++i)
{
fin >> v[i];
}
for(int i=0; i<M; ++i)
{
fin >> l >> r;
int minnr = INT_MAX;
for(int c=l-1; c<=r-1; ++c)
{
minnr = min(v[c], minnr);
}
fout << minnr << "\n";
}
return 0;
}
