Pagini recente » Cod sursa (job #2557598) | Cod sursa (job #1127828) | Cod sursa (job #100729) | Cod sursa (job #877336) | Cod sursa (job #2866753)
#include <iostream>
#include <fstream>
#define LOG 17
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int v[100002], puteri[100002], rmq[100002][LOG];
int main()
{
int n, m, i, j, x, y;
fin >> n >> m;
for(i = 1; i <= n; i++)
{
fin >> v[i];
rmq[i][0] = v[i];
}
puteri[1] = 0;
for(i = 2; i <= 100002; i++)
puteri[i] = puteri[i / 2] + 1;
for(j = 1; j <= LOG; j++)
for(i = 1; i <= n - (1 << j) + 1; i++)
rmq[i][j] = min(rmq[i][j - 1], rmq[i + (1 <<(j-1))][j - 1]);
for(i = 1; i <= m; i++)
{
fin >> x >> y;
int lung = y - x + 1;
fout << min(rmq[x][puteri[lung]], rmq[y - (1 << puteri[lung]) + 1][puteri[lung]]) << "\n";
}
return 0;
}