Cod sursa(job #2499221)
Utilizator | Data | 25 noiembrie 2019 18:00:32 | |
---|---|---|---|
Problema | Range minimum query | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n, m, i, v[100001], st, dr, minim, j;
int main()
{
f >> n >> m;
for (i=1; i<=n; i++)
f >> v[i];
for(i=1; i<=m; i++)
{
f >> st >> dr;
minim = 9999999;
for (j=st; j<=dr; j++)
if(v[j] < minim)
minim = v[j];
g << minim << '\n';
}
return 0;
}