Pagini recente » Cod sursa (job #392461) | Cod sursa (job #1374438) | Cod sursa (job #1628726) | Cod sursa (job #1259118) | Cod sursa (job #1812295)
#include <bits/stdc++.h>
using namespace std;
int N,n,m;
int a[400003];
int Query(int p,int x,int y,int st,int dr)
{
int mijl;
if(x==st && y==dr)
return a[p];
mijl=(st+dr)/2;
if(y<=mijl)
return Query(2*p,x,y,st,mijl);
if(x>=mijl+1)
return Query(2*p+1,x,y,mijl+1,dr);
return min(Query(2*p,x,mijl,st,mijl),Query(2*p+1,mijl+1,y,mijl+1,dr));
}
void Citire()
{
int i,op,x,y;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
fin>>n>>m;
N=1;
while(N<n)
N*=2;
for(i=N;i<N+n;++i)
fin>>a[i];
for(i=N-1;i>=1;--i)
a[i]=min(a[2*i],a[2*i+1]);
//operatii
for(i=1;i<=m;++i)
{
fin>>x>>y;
fout<<Query(1,x,y,1,N)<<"\n";
//else
//Update(x,y);
}
fin.close();
fout.close();
}
int main()
{
Citire();
return 0;
}