Pagini recente » Cod sursa (job #2920249) | Cod sursa (job #245857) | Cod sursa (job #2086147) | Istoria paginii fmi-no-stress-4/solutii/pariuri | Cod sursa (job #1795554)
#include <fstream>
#include <vector>
#include <iterator>
#include <algorithm>
using namespace std;
ifstream cin("rmq.in");
ofstream cout("rmq.out");
vector <int> a;
main()
{
int n,m,x,y;
cin >> n >> m;
a.resize(n);
for (int i=0; i<a.size(); i++)
{
cin >> a[i];
}
for (int i=0; i<m; i++)
{
cin >> x >> y;
cout << *min_element(a.begin()+x-1,a.end()+y-a.size()) << '\n';
}
}