Pagini recente » Cod sursa (job #2604447) | Cod sursa (job #2341524) | Cod sursa (job #1981630) | Cod sursa (job #323088) | Cod sursa (job #2106283)
#include <fstream>
using namespace std;
ifstream cin("rmq.in");
ofstream cout("rmq.out");
const int nmax=100000,logmax=16;
int n,m,v[nmax+5],rmq[nmax+5][logmax+5],log_2[nmax+5];
void build()
{
for(int i=1;(1<<i)<=n;i++)
log_2[1<<i]=1;
for(int i=1;i<=n;i++)
log_2[i]+=log_2[i-1];
for(int i=1;i<=n;i++)
rmq[i][0]=v[i];
for(int k=1;(1<<k)<=n;k++)
for(int i=1;i+(1<<k)-1<=n;i++)
rmq[i][k]=min(rmq[i][k-1],rmq[i+(1<<(k-1))][k-1]);
}
int main()
{
cin>>n>>m;
for(int i=1;i<=n;i++)
cin>>v[i];
build();
for(int i=1;i<=m;i++)
{
int st,dr,l,k;
cin>>st>>dr;
l=dr-st+1;
k=log_2[l];
cout<<min(rmq[st][k],rmq[dr-(1<<k)+1][k])<<"\n";
}
return 0;
}
/**
**/