Pagini recente » Cod sursa (job #1191396) | Cod sursa (job #656326) | Cod sursa (job #1188621) | Cod sursa (job #911738) | Cod sursa (job #3000198)
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n, m, v[18][100010];
int main()
{
fin >> n >> m;
for (int i = 1; i <= n; i++)
{
fin >> v[0][i];
}
int exp = 1;
for (int p2 = 2; p2 <=n; p2*=2)
{
for (int i = 1; i <= n - p2/2 + 1; i++)
{
v[exp][i] = min(v[exp-1][i], v[exp-1][i+(p2/2)]);
}
exp++;
}
for (int i = 1; i <= m; i++)
{
int x, y;
fin >> x >> y;
int lg = y-x+1;
int mg = log2(lg);
fout << min(v[mg][x], v[mg][y-(1<<mg)+1]) << '\n';
}
return 0;
}