Pagini recente » Cod sursa (job #3348491) | Cod sursa (job #1537529) | Cod sursa (job #1974597) | Cod sursa (job #498889) | Cod sursa (job #3319385)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
const int NMAX = 1e5 + 2;
int n, m, log_2[NMAX], pow_2[18], mat[18][NMAX];
int main()
{
log_2[1] = 0;
for(int i = 2; i < NMAX; i++)
{
log_2[i] = 1 + log_2[i / 2];
}
pow_2[0] = 1;
for(int i = 1; i <= 16; i++)
{
pow_2[i] = pow_2[i - 1] * 2;
}
fin >> n >> m;
for(int i = 1; i <= n; i++)
{
fin >> mat[0][i];
}
for(int i = 1; i <= 16; i++)
{
for(int j = 1; j <= n - pow_2[i] + 1; j++)
{
mat[i][j] = min(mat[i - 1][j], mat[i - 1][j + pow_2[i - 1]]);
}
}
for(int i = 1; i <= m; i++)
{
int l, r;
fin >> l >> r;
int p = log_2[r - l + 1];
fout << min(mat[p][l], mat[p][r - pow_2[p] + 1]) << "\n";
}
return 0;
}