Pagini recente » Cod sursa (job #1196438) | Cod sursa (job #3268420) | Cod sursa (job #289902) | Cod sursa (job #3264834) | Cod sursa (job #1371420)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
int main()
{
ifstream in ("rmq.in");
ofstream out ("rmq.out");
int n,intrebari ;
in >> n >> intrebari ;
int v[n+1] ;
struct L {int inc ; int fin; };
L inter[intrebari+1] ;
int i;
for (i=1;i<=n;i++) in >> v[i] ;
for (i=1;i<=intrebari;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;
}