Pagini recente » Cod sursa (job #1230652) | Cod sursa (job #1846339) | Cod sursa (job #1624447) | Cod sursa (job #2743580) | Cod sursa (job #1813616)
/// Problema "Rmq" - InfoArena
#include <cstdio>
#include <algorithm>
#define in "rmq.in"
#define out "rmq.out"
#define NMAX (100000 + 7)
#define RAD 350
using namespace std;
int N, M, v[NMAX], a, b, batog[RAD], ct;
int main()
{
freopen(in, "r", stdin);
freopen(out, "w", stdout);
for(int i = 0; i< RAD; ++i) batog[i] = NMAX;
scanf("%d %d", &N, &M);
for(int i = 1; i<= N; ++i)
{
scanf("%d", &v[i]);
if(i%RAD) ++ct;
batog[ct] = min(batog[ct], v[i]);
}
for( ; M; --M)
{
scanf("%d %d", &a, &b);
int sol = NMAX;
if((a/RAD) == (b/RAD))
{
for(int i = a; i<= b; ++i)
{
sol = min(sol, v[i]);
}
printf("%d\n", sol);
continue;
}
while(a%RAD)
{
sol = min(sol, v[a]);
++a;
}
while(b%RAD != (RAD-1))
{
sol = min(sol, v[b]);
--b;
}
int tmp1 = a/RAD, tmp2 = b/RAD;
for(int i = tmp1; i<= tmp2; ++i) sol = min(sol, batog[i]);
printf("%d\n", sol);
}
return 0;
}