Pagini recente » Cod sursa (job #2924815) | Cod sursa (job #1213607) | Cod sursa (job #1086895) | Cod sursa (job #385476) | Cod sursa (job #2865181)
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n, m, i, j, a, delta, b, l, rmq[20][100001];
int main()
{
fin >> n >> m;
for (i = 1; i <= n; i++)
fin >> rmq[0][i];
for (i = 1; (1 << i) <= n; i++)
{
for (j = 1; j <= n - (1 << i) + 1; j++)
{
l = 1 << i-1;
rmq[i][j] = min (rmq[i-1][j], rmq[i-1][j+l]);
}
}
for (i = 1; i <= m; i++)
{
fin >> a >> b;
delta = b-a+1;
l = int(log2(delta));
fout << min (rmq[l][a], rmq[l][a + delta - (1 << l)]) << "\n";
}
return 0;
}