Pagini recente » Cod sursa (job #2803599) | Cod sursa (job #2030017) | Cod sursa (job #1474035) | Cod sursa (job #1924782) | Cod sursa (job #2570196)
#include <bits/stdc++.h>
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
int n,m,a[100005],rmq[100005][26],x,y;
int logg(int x)
{
int ans=0;
while(x/2>=1)
{
x/=2;
ans++;
}
return ans;
}
int main()
{
in>>n>>m;
for(int i=1;i<=n;i++) {
in>>a[i];
rmq[i][0]=a[i];
}
for(int i=1;(1<<i)<=n;i++)
for(int j=1;j+(1<<i)-1<=n;j++)
rmq[j][i]=min(rmq[j][i-1],rmq[j+(1<<(i-1))][i-1]);
while(m--)
{
in>>x>>y;
int l=y-x+1;
l=logg(l);
out<<min(rmq[x][l],rmq[y-(1<<l)+1][l])<<'\n';
}
return 0;
}