Pagini recente » Cod sursa (job #1825320) | Cod sursa (job #404360) | Cod sursa (job #2485988) | Cod sursa (job #2716688) | Cod sursa (job #2612449)
#include<bits/stdc++.h>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
#define maxn 100005
#define lmax 20
long int rmq[lmax][lmax];
long int n,m;
long int lg[maxn];
long int a[maxn];
int main()
{
long int i,j,l;
fin>>n>>m;
for(int i=1;i<=n;i++)
fin>>a[i];
lg[1]=0;
for(int i=2;i<=n;i++)
lg[i]=lg[i/2]+1;
for(int 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+1]);
}
}
long int x,y,dif,sh;
for(int i=1;i<=m;i++)
{
fin>>x>>y;
dif=y-x+1;
l=lg[dif];
sh=dif-(1<<l);
fout<<min(rmq[l][x],rmq[l][x+sh])<<"\n";
}
return 0;
}