Pagini recente » Cod sursa (job #3230061) | Cod sursa (job #702522) | Cod sursa (job #1851765) | Cod sursa (job #1180622) | Cod sursa (job #3269824)
#include <fstream>
using namespace std;
ifstream cin ("rmq.in");
ofstream cout ("rmq.out");
long long int cer,t,n,m,a[100002],lg[100002],rmq[18][100002],b,c,x,sh,diff,y,l,r,i,j,ok,nr,ans,k,mini,maxi,poz,mod=1e9+7;
string s;
void solve()
{
cin>>n>>m;
for(i=1;i<=n;i++)
cin>>a[i];
lg[1]=0;
for(i=2;i<=n;i++)
lg[i]=lg[i/2]+1;
for(i=1;i<=n;i++)
rmq[0][i]=a[i];
for(i=1;(1<<i)<=n;i++)
for(j=1;j<=n-(1<<i)+1;j++)
{
l=1<<(i-1);
rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+l]);
}
for(i=1;i<=m;i++)
{
cin>>x>>y;
diff=y-x+1;
l=lg[diff];
sh=diff-(1<<l);
cout<<min(rmq[l][x],rmq[l][x+sh])<<'\n';
}
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
solve();
return 0;
}