Pagini recente » Cod sursa (job #1135023) | Cod sursa (job #3279087) | Cod sursa (job #570175) | Cod sursa (job #108817) | Cod sursa (job #3226149)
#include <fstream>
#include <cstring>
using namespace std;
ifstream cin("rmq.in");
ofstream cout("rmq.out");
int n,m,r[17][100005],e[100005];
int exp,l;
int main()
{
cin>>n>>m;
for(int i=1;i<=n;i++)
cin>>r[0][i];
e[1]=0;
for(int i=2;i<=n;i++)
e[i]=1+e[i/2];
for(int p=1;(1<<p)<=n;p++)
for(int i=1;i<=n;i++)
{
int j=i+(1<<(p-1));
r[p][i]=r[p-1][i];
if(j<=n)
r[p][i]=min(r[p][i],r[p-1][j]);
}
while(m--)
{
int x,y;
cin>>x>>y;
exp=e[y-x+1];
l=(1<<exp);
cout<<min(r[exp][x],r[exp][y-l+1])<<'\n';
}
return 0;
}