Pagini recente » Cod sursa (job #1753274) | Cod sursa (job #2386437) | Cod sursa (job #1102513) | Cod sursa (job #3308953) | Cod sursa (job #3328959)
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
const int nMax=2e5+5,MOD=1e9+7,lg=20;
int t,n,m,x,y,z,a,b,c,d,k,ans,rez,poz,cnt,len,l,r,e,f;
ll v[nMax],Xor[nMax],sum[nMax],sqSum[nMax],xor1[nMax],sum1[nMax],sqSum1[nMax],rmq[lg][nMax],E[nMax];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0),cout.tie(0);
fin>>n>>t;
for(int i=1; i<=n; ++i)
fin>>rmq[0][i];
for(int bit=1; bit<lg; ++bit)
for(int i=1; i<=n; ++i)
{
x=i;
y=min(n,x+(1<<(bit-1)));
rmq[bit][i]=min(rmq[bit-1][x],rmq[bit-1][y]);
}
E[1]=0;
for(int i=2; i<=n; ++i)
E[i]=E[i/2]+1;
while(t--)
{
fin>>l>>r;
len=r-l+1;
e=E[len];
x=min(rmq[e][l],rmq[e][r-(1<<e)+1]);
fout<<x<<'\n';
}
}