Pagini recente » Cod sursa (job #1361794) | Cod sursa (job #2485739) | Cod sursa (job #2210671) | Cod sursa (job #1108245) | Cod sursa (job #3185312)
#include <iostream>
#include <fstream>
using namespace std;
int v[100001], log2[100001], rmq[17][100001];
int main()
{
ifstream cin("rmq.in");
ofstream cout("rmq.out");
int n, m, i, j, e, p, st, dr;
cin >> n >> m;
for(i = 1; i <= n; i++)
{
cin >> v[i];
rmq[0][i] = v[i];
}
for(i = 1; (1 << i) <= n; i++)
{
for(j = 1; j + (1 << i) - 1 <= n; j++)
{
p = (1 << (i - 1));
rmq[i][j] = min(rmq[i - 1][j + p], rmq[i - 1][j]);
}
}
log2[1] = 0;
for(i = 2; i <= n; i++)
{
log2[i] = 1 + log2[i / 2];
}
for(i = 1; i <= m; i++)
{
cin >> st >> dr;
e = log2[dr - st + 1];
p = (1 << e);
cout << min(rmq[e][st], rmq[e][dr - p + 1]) << "\n";
}
return 0;
}