Pagini recente » Cod sursa (job #1259485) | Cod sursa (job #1996518) | Cod sursa (job #3158843) | Cod sursa (job #2393595) | Cod sursa (job #3253472)
#include <fstream>
#include <climits>
#define NMAX 100002
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int N,M,v[NMAX],aint[4*NMAX];
void citire()
{
fin>>N>>M;
for(int i=1; i<=N; i++)
{
fin>>v[i];
}
}
void build(int nod, int st, int dr)
{
if(st==dr)
{
aint[nod]=v[st];
}
else
{
int pmijl=(st+dr)/2;
build(2*nod,st,pmijl);
build(2*nod+1,pmijl+1,dr);
aint[nod]=min(aint[2*nod],aint[2*nod+1]);
}
}
int query(int a, int b, int nod, int st, int dr)
{
if(st>b || dr<a)
{
return INT_MAX;
}
if(a<=st && dr<=b)
{
return aint[nod];
}
int pmijl=(st+dr)/2;
int r1=query(a,b,2*nod,st,pmijl);
int r2=query(a,b,2*nod+1,pmijl+1,dr);
return min(r1,r2);
}
int main()
{
int a,b;
citire();
build(1,1,N);
for(int i=1; i<=M; i++)
{
fin>>a>>b;
fout<< query(a,b,1,1,N) << "\n";
}
return 0;
}