Pagini recente » Cod sursa (job #354467) | Cod sursa (job #2467845) | Cod sursa (job #1690906) | Cod sursa (job #2816476) | Cod sursa (job #1291585)
#include <stdio.h>
#include <vector>
using namespace std;
#define NMAX 100002
#define LMAX 18
long int rmq[LMAX][NMAX];
long int n,m;
long int lg[NMAX];
long int a[NMAX];
int main()
{
freopen("rmq.in","r",stdin);
freopen("rmq.out","w",stdout);
long int i,j,l,y,x;
scanf("%ld %ld",&n,&m);
for (i=1;i<=n;i++)
scanf("%ld ",&a[i]);
lg[1]=0;
for (i=2;i<=n;i++)
lg[i]=lg[i/2]+1;
for (i=1;i<=n;i++)
rmq[0][i]=a[i];
for (i=1; (1 << i) <=n; i++)
for (j=(1<<i);j <=n; j++)
{
l=1<<(i-1);
rmq[i][j]= min( rmq[i-1][j] , rmq[i-1][j-l] );
}
for (i=1;i<=m;i++)
{
scanf("%ld %ld",&x,&y);
l=lg[y-x+1];
printf("%ld\n",min(rmq[l][x-1+(1<<l)],rmq[l][y]) );
}
return 0;
}