Pagini recente » Cod sursa (job #1956393) | Cod sursa (job #997707) | Cod sursa (job #3273243) | Cod sursa (job #260323) | Cod sursa (job #3277937)
#include <fstream>
#include <cmath>
using namespace std;
ifstream in;
ofstream ou;
int n, m, rmq[18][100005], sz;
int main()
{
in.open("rmq.in");
ou.open("rmq.out");
in >> n >> m;
for (int i = 0; i < n; i++)
{
in >> rmq[0][i];
}
sz = log2(n);
for (int j = 1; j <= sz; j++)
{
for (int i = 0; i < n-(1<<j)+1; i++)
{
rmq[j][i] = min(rmq[j-1][i], rmq[j-1][i+(1<<(j-1))]);
}
}
for (int i = 0; i < m; i++)
{
int x, y;
in >> x >> y;
x--; y--;
int h = log2(y-x);
ou << min(rmq[h][x], rmq[h][y-(1<<h)+1]) << "\n";
}
}