Cod sursa(job #1860671)
| Utilizator | Data | 28 ianuarie 2017 11:51:37 | |
|---|---|---|---|
| Problema | Range minimum query | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream fin ("rmq.in");
ofstream fout ("rmq.out");
unsigned int N, M;
unsigned int A[100001];
unsigned int x, y;
unsigned int i, j;
unsigned int minimum;
int main ()
{
fin >> N >> M;
for (i=1; i<=N; i++)
fin >> A[i];
for (i=1; i<=M; i++)
{
fin >> x >> y;
minimum = A[x];
for (j=2; j<=y; j++)
if (A[j] < minimum)
minimum = A[j];
fout << minimum << '\n';
}
return 0;
}
