Pagini recente » Cod sursa (job #1930902) | Cod sursa (job #612169) | Cod sursa (job #2659133) | Cod sursa (job #1349146) | Cod sursa (job #2530719)
#include <fstream>
#include <cstring>
#define Nmax 400012
#define INF 0x3f3f3f3f
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n,m,v[Nmax];
int poz,val,inc,sf,min1;
void update(int nod,int p,int u)
{
if (p==u)
{
v[nod]=val;
return;
}
int mij=(p+u)/2;
if (poz<=mij)
update(2*nod,p,mij);
else
update(2*nod+1,mij+1,u);
v[nod]=min(v[2*nod],v[2*nod+1]);
}
void suma(int nod,int p,int u)
{
if (inc<=p && u<=sf)
{
min1=min(min1,v[nod]);
return;
}
int mij=(u+p)/2;
if (inc<=mij)
suma(nod*2,p,mij);
if (mij<sf)
suma(nod*2+1,mij+1,u);
}
int main()
{
int i,a,b;
fin>>n>>m;
memset(v,INF,sizeof v);
for (i=1;i<=n;i++){
fin>>a;
val=a;
poz=i;
update(1,1,n);
}
for (i=1;i<=m;i++)
{
fin>>a>>b;
inc=a,sf=b,min1=1000000;
suma(1,1,n);
fout<<min1<<"\n";
}
return 0;
}