Cod sursa(job #1371395)
Utilizator | Data | 3 martie 2015 21:15:01 | |
---|---|---|---|
Problema | Range minimum query | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
int main()
{
ifstream in("rmq.in");
int n,m;
in >> n >> m;
int a[n+1],i,j,x,y;
for(i=1;i<=n;i++)
in>>a[i];
for(j=1;j<=m;j++) {
in >> x >> y;
cout << *min_element(a+x,a+y+1) << endl;
}
in.close();
return 0;
}