Pagini recente » Cod sursa (job #151652) | Cod sursa (job #1162416) | Cod sursa (job #386706) | Cod sursa (job #1709027) | Cod sursa (job #2320850)
#include <bits/stdc++.h>
using namespace std;
#define NMAX 100002
#define LMAX 18
long int rmq[LMAX][NMAX], n, m, lg[NMAX], a[NMAX];
long int x, y, diff, sh, i, j, l;
int main()
{
ifstream f("rmq.in");
ofstream g("rmq.out");
f >> n >> m;
for (i = 1; i <= n; i ++)
f >> a[i];
lg[1] = 0;
for (i = 2; i <= n; i ++)
lg[i] = lg[i / 2] + 1;
for (i = 1;i <= n; i ++)
rmq[0][i] = a[i];
for (i = 1; 2 * i <= n;i++)
for(j = 1; j <= n - 2 * i + 1; j ++)
{
if(i != 1)l = 2 * (i - 1);
else l = 1;
rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + l]);
}
for (i = 1; i <= m; i ++)
{
f >> x >> y;
diff = y - x + 1;
l = lg[diff];
sh = diff - 2 * l;
g << min(rmq[l][x],rmq[l][x + sh]) << "\n";
}
return 0;
}