Pagini recente » Cod sursa (job #2878211) | Cod sursa (job #2442739) | Cod sursa (job #2629459) | Cod sursa (job #68715) | Cod sursa (job #2845954)
#include <bits/stdc++.h>
#define N 100005
#define M 20
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int a[N],rmq[M][N],n,m;
int main()
{
int i,j,x,y;
fin>>n>>m;
for(i=1;i<=n;i++) fin>>a[i];
for(i=1;i<=n;i++) rmq[0][i]=a[i];
for(i=1;i<=log2(n);i++)
for(j=1;j+(1<<i)-1<=n;j++)
rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+(1<<i-1)]);
while(m--)
{
fin>>x>>y;
int lg=log2(y-x+1);
fout<<min(rmq[lg][x],rmq[lg][y-(1<<lg)+1])<<"\n";
}
return 0;
}