Pagini recente » Borderou de evaluare (job #1330305) | Clasamentul arhivei Infoarena Monthly | Clasament fanninfo | Cod sursa (job #2398905) | Cod sursa (job #3274604)
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
int main()
{
std::ifstream fin("rmq.in");
std::ofstream fout("rmq.out");
int N,
M;
fin >> N >> M;
std::vector<int> nums(N);
for (int i = 0; i < N; i++)
{
fin >> nums[i];
}
for (int i = 0; i < M; i++)
{
int x, y;
fin >> x >> y;
int min_element = *std::min_element(nums.begin() + x - 1, nums.begin() + y);
fout << min_element << "\n";
}
fin.close();
fout.close();
return 0;
}