Pagini recente » Cod sursa (job #2436278) | Cod sursa (job #2375994) | Cod sursa (job #968266) | Cod sursa (job #1757911) | Cod sursa (job #3216333)
#include <fstream>
#include <cmath>
using namespace std;
ifstream cin("rmq.in");
ofstream cout("rmq.out");
int rmq[19][100005];
int e;
int n, m;
int main()
{
int i, j, L=1, exp;
cin >> n >> m;
for (i = 1; i <= n; i++)
cin >> rmq[0][i];
e= log2(n);
for (i = 1; i <= e; i++)
{
L=(1<<L);
for (j = 1; j <= n - L + 1; j++)
rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + L / 2]);
}
while (m)
{
cin >> i >> j;
exp = log2(j - i + 1);
L = (1 << exp);
cout << min(rmq[exp][i], rmq[exp][j - L + 1]) << "\n";
m--;
}
return 0;
}