Pagini recente » Cod sursa (job #2983067) | Cod sursa (job #2732240) | Cod sursa (job #1075150) | Cod sursa (job #686222) | Cod sursa (job #1878305)
#include <iostream>
#include <fstream>
//#define min(a, b) ( ( a < b ) ? a : b)
#define NMAX 100005
using namespace std;
ifstream f ("rmq.in");
ofstream g ("rmq.out");
int v[NMAX], n, m, a[NMAX][20], lg[NMAX];
int main()
{
f>>n>>m;
for (int i = 1; i <= n; i++)
f>>a[i][0];
lg[1]=0;
for (int i = 2; i <= n; i++)
lg[i] = lg[i / 2] + 1;
for (int p = 1; 1<<p <= n; p++)
{
for (int i = 1; i <= n - (1<<p) + 1; i++)
a[i][p] = min(a[i][p - 1], a[i + (1<<(p - 1))][p - 1]);
}
for (int x, y, i = 1; i <= m; i++)
{
int q, dif, l, sh;
f>>x>>y;
dif = y - x + 1;
l = lg[dif];
sh = dif - (1<<l);
g<<min(a[x][l], a[x + sh][l])<<'\n';
}
return 0;
}