Pagini recente » Cod sursa (job #2838182) | Cod sursa (job #2112839) | Cod sursa (job #297489) | Cod sursa (job #1997410) | Cod sursa (job #168871)
Cod sursa(job #168871)
#include <cstdio>
#include <vector>
using namespace std;
#define NMAX 100002
#define LMAX 18
int rmq[LMAX][NMAX];
int n,m,l;
int lg[NMAX];
int a[NMAX];
int main()
{
freopen("rmq.in","r",stdin);
freopen("rmq.out","w",stdout);
scanf("%d%d", &n, &m);
for (int i=1; i<=n; i++)
{
scanf("%d", &a[i]);
lg[1]=0;
lg[i]=lg[i/2]+1;
rmq[0][i]=a[i];
}
for (int i=1; 1<<i<=n; i++)
for (int 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 (int 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]));
}
return 0;
}