Cod sursa(job #1599324)
| Utilizator | Data | 13 februarie 2016 19:28:05 | |
|---|---|---|---|
| Problema | Range minimum query | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
#include <climits>
#define MAX 100001
using namespace std;
ifstream fin ("rmq.in");
ofstream fout ("rmq.out");
int a[MAX];
int n, m, i, x, y, j;
int min_elm;
int main ()
{
fin >> n >> m;
for (i=0; i<n; i++)
fin >> a[i];
for (i=0; i<m; i++)
{
fin >> x >> y;
min_elm = INT_MAX;
for (j=x; j<=y; j++)
if (a[j] < min_elm)
min_elm = a[j];
fout << min_elm << "\n";
}
return 0;
}
