Pagini recente » Cod sursa (job #1173613) | Istoria paginii runda/123345 | Cod sursa (job #877848) | Cod sursa (job #1490525) | Cod sursa (job #301771)
Cod sursa(job #301771)
#include<stdio.h>
#define MAXN 100005
#define MAXLOG 20
int n,m,i,x,y,q,lg,rez,j,l;
int a[MAXN][MAXLOG];
int main(void)
{
freopen("rmq.in","r",stdin);
freopen("rmq.out","w",stdout);
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++)
scanf("%d",&a[i][0]);
for(j=1;(1<<j)<=n;j++)
for(i=1;i<= n - (1<<j) + 1; i++)
{
a[i][j]=a[i][j-1];
if(a[i + (1<<(j-1))][j-1] < a[i][j])
a[i][j]=a[i + (1<<(j-1))][j-1];
}
while(m--)
{
scanf("%d%d",&x,&y);
lg=y-x+1;
for(q=2,l=0;q<=lg;l++,q<<=1);
q>>=1;
rez=a[x][l];
if(a[y - q + 1][l] < rez)
rez=a[y - q + 1][l];
printf("%d\n",rez);
}
return 0;
}