Pagini recente » Istoria paginii runda/branza | Cod sursa (job #791837) | Cod sursa (job #2009270) | Cod sursa (job #1784449) | Cod sursa (job #2903857)
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int noduri[500001], valori[200001];
void valoareNod(int nod, int st, int dr)
{
if (st == dr)
{
noduri[nod] = valori[st];
return;
}
valoareNod(nod * 2, st, (st + dr) / 2);
valoareNod(nod * 2 + 1, (st + dr) / 2 + 1, dr);
noduri[nod] = min(noduri[2 * nod], noduri[2 * nod + 1]);
}
int valMinima(int indiceNod, int st, int dr, int val1, int val2)
{
if (val2 < st || dr < val1) return 100004;
if (val1 <= st && dr <= val2) return noduri[indiceNod];
int valMinSt = 100004, valMinDr = 100004, mij = (st + dr) / 2;
if (val1 <= mij)
valMinSt = valMinima(indiceNod * 2, st, mij, val1, val2);
if (val2 > mij)
valMinDr = valMinima(indiceNod * 2 + 1, mij + 1, dr, val1, val2);
return min(valMinSt, valMinDr);
}
int main()
{
int nrElemente, nrIntrebari;
fin >> nrElemente >> nrIntrebari;
for (int i = 1; i <= nrElemente; i++)
fin >> valori[i];
valoareNod(1, 1, nrElemente);
for (int i = 1; i <= nrIntrebari; i++)
{
int x, y; fin >> x >> y;
fout << valMinima(1, 1, nrElemente, x, y) << '\n';
}
}