Cod sursa(job #1469996)
Utilizator | Data | 10 august 2015 10:13:42 | |
---|---|---|---|
Problema | Range minimum query | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int a[100000];
int n, m, i, x, y, j;
int min_elm;
int main ()
{
f >> n >> m;
for (i=1; i<=n; i++)
f >> a[i];
for (i=1; i<=m; i++)
{
f >> x >> y;
min_elm = 1000000;
for (j=x; j<=y; j++)
if (a[j] < min_elm)
min_elm = a[j];
g << min_elm << "\n";
}
return 0;
}