Pagini recente » Cod sursa (job #314611) | Cod sursa (job #1827198) | Cod sursa (job #3196210) | Cod sursa (job #196527) | Cod sursa (job #440349)
Cod sursa(job #440349)
#include<stdio.h>
#define NM 100005
int v[NM],M[NM][20],n,m,i,x,y,j,lg[NM];
int main()
{
freopen("rmq.in","r",stdin);
freopen("rmq.out","w",stdout);
scanf("%d %d",&n,&m);
for(i=0;i<n;i++)
scanf("%d",&v[i]);
for(i=0;i<n;i++)
M[i][0]=i;
for(i=2;i<=n;i++)
lg[i]=lg[i/2]+1;
for(j=1;(1<<j)<=n;j++)
for(i=0;i+(1<<j)-1<n;i++)
if(v[M[i][j-1]]<=v[M[i+(1<<(j-1))][j-1]])
M[i][j]=M[i][j-1];
else M[i][j]=M[i+(1<<(j-1))][j-1];
for(i=0;i<m;i++)
{
scanf("%d %d",&x,&y);
x--;
y--;
int k=lg[y-x+1];
if(v[M[x][k]]<=v[M[y-(1<<k)+1][k]])
printf("%d\n",v[M[x][k]]);
else printf("%d\n",v[M[y-(1<<k)+1][k]]);
}
return 0;
}