Pagini recente » Cod sursa (job #684311) | Cod sursa (job #1498072) | Cod sursa (job #888472) | Cod sursa (job #333069) | Cod sursa (job #3005596)
#include <fstream>
using namespace std;
ifstream cin("rmq.in");
ofstream cout("rmq.out");
int n,m;
int rmq[17][100001];
int E[100001];
int main()
{
cin>>n>>m;
for(int i=0;i<n;i++)
cin>>rmq[0][i];
for(int p=1;(1<<p)<=n;p++)
{
for(int i=0;i<n;i++)
{
int l=(1<<(p-1));
rmq[p][i]=rmq[p-1][i];
if(i+l<n)
rmq[p][i]=min(rmq[p][i],rmq[p-1][i+l]);
}
}
for(int i=2;i<=n;i++)
E[i]=1+E[i/2];
for(int i=0;i<m;i++)
{
int st,dr;
cin>>st>>dr;
st--;
dr--;
int l=dr-st+1;
int e=E[l];
int power=(1<<e);
cout<<min(rmq[e][st],rmq[e][dr-power+1])<<'\n';
}
return 0;
}