Pagini recente » Borderou de evaluare (job #1811337) | Borderou de evaluare (job #1563326) | Borderou de evaluare (job #1011621) | Borderou de evaluare (job #1824812) | Cod sursa (job #1970782)
///aint iterativ
#include <bits/stdc++.h>
using namespace std;
int m,n,i,x,y,v[200010];
void build()
{
for(i=n-1; i>=1; --i)
v[i]=min(v[i*2],v[i*2+1]);
}
int querry(int l,int r)
{
int ans=200000;
l+=n-1;
r+=n;
while(l<r)
{
if(l%2==1)ans=min(ans,v[l++]);
if(r%2==1)ans=min(ans,v[--r]);
l/=2;
r/=2;
}
return ans;
}
int main()
{
ifstream f ("rmq.in");
ofstream g ("rmq.out");
f>>n>>m;
for(i=0; i<n; ++i)
f>>v[i+n];
build();
for(i=1; i<=m; ++i)
{
f>>x>>y;
g<<querry(x,y)<<'\n';
}
return 0;
}