Pagini recente » Cod sursa (job #1345720) | Cod sursa (job #2446322) | Cod sursa (job #2827688) | Cod sursa (job #1578199) | Cod sursa (job #3284960)
#include <fstream>
#define nmax 100001
using namespace std;
ifstream cin("rmq.in");
ofstream cout("rmq.out");
int rmq[20][nmax],p[nmax],n,q,x,y;
int main()
{
cin>>n>>q;
for(int i=1;i<=n;i++)
cin>>rmq[0][i];
for(int i=1;(1<<i)<=n;i++)
for(int j=1;j<=n;j++){
rmq[i][j]=rmq[i-1][j];
if(j+(1<<(i-1))<=n)
rmq[i][j]=min(rmq[i][j],rmq[i-1][j+(1<<(i-1))]);
}
for(int i=2;i<=n;i++)
p[i]=p[i/2]+1;
while(q--){
cin>>x>>y;
int e=p[y-x+1];
cout<<min(rmq[e][x],rmq[e][y-(1<<e)+1])<<'\n';
}
return 0;
}