Pagini recente » Cod sursa (job #2099027) | Cod sursa (job #2643677) | Cod sursa (job #2517103) | Cod sursa (job #2675358) | Cod sursa (job #2879220)
#include <fstream>
#include <vector>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
vector <int> put2;
vector <vector <int>> range;
int main ()
{
int n, m, i, j, sz, x, y, distanta, indice, putere;
f >> n >> m;
put2.resize (n + 1), put2[1] = 0;
for (i = 2; i <= n; i += 1)
put2[i] = 1 + put2[i / 2];
sz = put2[n] + 1;
range.assign (sz + 2, vector <int> (n + 1));
for (i = 1; i <= n; i += 1)
f >> range[0][i];
for (i = 1; i <= sz; i += 1)
{
for (j = 1; j <= n; j += 1)
{
range[i][j] = range[i - 1][j];
if (j + (1 << (i - 1)) <= n and range[i - 1][j + (1 << (i - 1))] < range[i][j])
range[i][j] = range[i - 1][j + (1 << (i - 1))];
}
}
for (i = 1; i <= m; i += 1)
{
f >> x >> y;
distanta = y - x + 1;
indice = put2[distanta];
putere = (1 << indice);
g << min (range[indice][x], range[indice][y - putere + 1]) << '\n';
}
return 0;
}