Pagini recente » Cod sursa (job #500047) | Cod sursa (job #3241049) | Cod sursa (job #2979348) | Cod sursa (job #1578210) | Cod sursa (job #2564181)
#include <cstdio>
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
freopen("rmq.in","r",stdin);
freopen("rmq.out","w",stdout);
int a[100005],q,n,rmq[100005][30],lg[100005],x,y,l;
int main()
{
scanf("%d%d",&n,&q);
for(int i=1;i<=n;i++)
scanf("%d",&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[i][0]=a[i];
for(int j=1;j<=lg[n];j++)
{
int put=(1<<j);
for(int i=1;i+put-1<=n;i++)
rmq[i][j]=min(rmq[i][j-1],rmq[i+put/2][j-1]);
}
while(q--)
{
scanf("%d%d",&x,&y);
l=lg[y-x+1];
printf("%d\n",min(rmq[x][l],rmq[y-(1<<k)+1][l]));
}
}