Pagini recente » Cod sursa (job #1571903) | Cod sursa (job #3247571) | Cod sursa (job #2754606) | Cod sursa (job #1631725) | Cod sursa (job #3293230)
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("rmq.in");
ofstream cout("rmq.out");
const int Nmax = 1e5 + 5, Lmax = 18;
int v[Nmax], rmq[Lmax][Nmax];
int n;
void buildrmq()
{
for (int i = 1; i <= n; i++)
rmq[0][i] = v[i];
for (int j = 1; j < Lmax; j++)
for(int i = 1; i <= n; i ++)
rmq[j][i] = min(rmq[j - 1][i], rmq[j - 1][i + (1 << (j - 1))]);
}
int query(int x, int y)
{
int dif = y - x + 1;
int lun = log2(dif);
return min(rmq[lun - 1][x], rmq[lun - 1][y - (1 << (lun - 1)) + 1]);
}
int main()
{
int m, a, b;
cin >> n >> m;
for (int i = 1; i <= n; i++)
cin >> v[i];
buildrmq();
/*for (int lg = 0; lg < 5; lg++)
{
for (int i = 1; i <= n; i++)
cout << rmq[lg][i] << " ";
cout << '\n';
}*/
while (m--)
{
cin >> a >> b;
cout << query(a, b) << '\n';
}
}