Pagini recente » Statistici muresan nicoleta (nicomuresan0205) | Cod sursa (job #1746695) | Rating maftei leonard (leonardo) | Cod sursa (job #1682444) | Cod sursa (job #1277968)
#include <fstream>
#define dim 400000
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int v[4*dim+2],n,i,x,y,minim,m;
void parc(int nod,int p,int u){
if(p==u){
fin>>v[nod];
return;
}
int m=(p+u)/2;
parc(2*nod,p,m);
parc(2*nod+1,m+1,u);
v[nod]=min(v[2*nod],v[2*nod+1]);
}
void query(int nod,int p,int u){
if(p>=x && u<=y){
minim=min(minim,v[nod]);
return;
}
int m=(p+u)/2;
if(m>=x)
query(2*nod,p,m);
if(m<y)
query(2*nod+1,m+1,u);
}
int main(){
fin>>n>>m;
parc(1,1,n);
for(i=1;i<=m;i++){
fin>>x>>y;
minim=dim;
query(1,1,n);
fout<<minim<<'\n';
}
fin.close();fout.close();
return 0;
}