Pagini recente » Cod sursa (job #167904) | Cod sursa (job #1004742) | Cod sursa (job #727617) | Cod sursa (job #1889670) | Cod sursa (job #1747132)
#include <fstream>
#define VAL 100005
#define INTR 200005
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int N, M, i, j;
int op, a, b;
int v[VAL], minim;
int aib[INTR];
void initializare(int nod, int st, int dr)
{
if (st==dr)
aib[nod]=v[st];
else
{
int mij=(st+dr) / 2;
initializare(2*nod, st, mij);
initializare(2*nod+1, mij+1, dr);
aib[nod]=min(aib[2*nod], aib[2*nod+1]);
}
}
void interogare(int nod, int st, int dr, int a, int b)
{
if (a<=st && dr<=b)
minim=min(minim, aib[nod]);
else
{
int mij=(st+dr) / 2;
if (a<=mij)
interogare(2*nod, st, mij, a, b);
if (mij+1<=b)
interogare(2*nod+1, mij+1, dr, a, b);
}
}
int main()
{
fin >> N >> M;
for (i=1; i<=N; i++)
fin >> v[i];
initializare(1, 1, N);
for (i=1; i<=M; i++)
{
fin >> a >> b;
minim=VAL;
interogare(1, 1, N, a, b);
fout << minim << '\n';
}
fin.close();
fout.close();
return 0;
}