Pagini recente » Cod sursa (job #1474120) | Cod sursa (job #2359854) | Cod sursa (job #2469599) | Cod sursa (job #1478177) | Cod sursa (job #998819)
Cod sursa(job #998819)
#include<stdio.h>
int v[100002],d[100002][20];
int main()
{
freopen("rmq.in","r",stdin);
freopen("rmq.out","w",stdout);
int n,m,i,j,x,y,sol;
scanf("%d%d",&n,&m);
for(i=1;i<=n;++i)
scanf("%d",&v[i]);
///////////////
for(i=1;i<=n;++i)
d[i][0]=i;
v[0]=2000000000;
for(j=1;1<<j<=n;++j)
{
for(i=1;i+(1<<j)-1<=n;++i)
{
if(v[d[i][j-1]]<=v[d[i+(1<<(j-1))][j-1]])
d[i][j]=d[i][j-1];
else
d[i][j]=d[i+(1<<(j-1))][j-1];
}
}
/*for(i=1;i<=n;++i)
{
for(j=1;j<=10;++j)
printf("%d ",v[d[i][j]]);
printf("\n");
}*/
///////////////
while(m--)
{
scanf("%d%d",&x,&y);
sol=2000000000;
i=x;
while(i<=y)
{
j=0;
while(i+(1<<j)-1<=y)
++j;
--j;
if(v[d[i][j]]<sol)
sol=v[d[i][j]];
i=i+(1<<j);
}
printf("%d\n",sol);
}
return 0;
}