Pagini recente » Cod sursa (job #1429702) | Cod sursa (job #3238618) | Cod sursa (job #2629731) | Cod sursa (job #2924066) | Cod sursa (job #2644241)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
long int N, M, a[100000], nr, i = 1, x, y, t, k = 1;
ifstream f("rmq.in");
ofstream g("rmq.out");
f >> N >> M;
while (i<=N)
{
f >> nr;
a[i] = nr;
i++;
}
while (k<=M)
{
f >> x >> y;
t = a[x];
while (x <= y)
{
if (a[x] < t)
t = a[x];
x++;
}
g << t << endl;
k++;
}
f.close();
g.close();
return 0;
}