Cod sursa(job #1371404)
| Utilizator | Data | 3 martie 2015 21:18:01 | |
|---|---|---|---|
| Problema | Range minimum query | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
int v[100001] ;
int main()
{
ifstream in ("rmq.in");
ofstream out ("rmq.out");
int n,intrebari ;
in >> n >> intrebari ;
int i,j ;
struct L {int inc ; int fin; };
L inter[n+1] ;
for (i=1;i<=n;i++) in >> v[i] ;
for (i=1;i<=n;i++) { in >> inter[i].inc;
in >> inter[i].fin ;}
for (i=1;i<=intrebari;i++)
{
out<< *min_element( v +inter[i].inc ,v+inter[i].fin+1 )<<'\n';
}
return 0;
}
