Cod sursa(job #2644242)
| Utilizator | Data | 24 august 2020 00:24:57 | |
|---|---|---|---|
| Problema | Range minimum query | Scor | 30 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
long int N, M, a[100000], nr, i, x, y, t, r;
ifstream f("rmq.in");
ofstream g("rmq.out");
f >> N >> M;
for (i = 1; i <= N; i++)
{
f >> nr;
a[i] = nr;
}
for (i = 1; i <= M; i++)
{
f >> x >> y;
t = a[x];
for (r = x; r <= y; r++)
{
if (a[r] < t)
t = a[r];
}
g << t << endl;
}
f.close();
g.close();
return 0;
}