Pagini recente » Cod sursa (job #2082959) | Cod sursa (job #1614753) | Cod sursa (job #192131) | Cod sursa (job #361115) | Cod sursa (job #1227637)
#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
#define NMAX 100002
#define LMAX 18
int rmq[LMAX][NMAX];
int n,m;
int lg[NMAX];
int a[NMAX];
int main()
{
freopen("rmq.in","rt",stdin);
freopen("rmq.out","wt",stdout);
int i,j,l;
scanf("%d%d",&n,&m);
for (i=1;i<=n;i++)
scanf("%d",&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;j <= n - (1 << i)+1;j++)
{
l=1<<(i-1);
rmq[i][j]= min( rmq[i-1][j] , rmq[i-1][j+l] );
}
int x,y,diff,sh;
for (i=1;i<=m;i++)
{
scanf("%d%d",&x,&y);
diff=y-x+1;
l=lg[diff];
sh=diff - (1<<l);
printf("%d\n",min(rmq[l][x],rmq[l][x+sh]) );
}
fclose(stdin);
fclose(stdout);
return 0;
}