Pagini recente » Cod sursa (job #125092) | Cod sursa (job #2950448) | Cod sursa (job #734548) | Cod sursa (job #4484) | Cod sursa (job #154814)
Cod sursa(job #154814)
#include <stdio.h>
int i,j,k,n,m,min,p,q;
int rmc[200010][30];
int main()
{
freopen("rmq.in","r",stdin);
freopen("rmq.out","w",stdout);
scanf("%d%d",&n,&m);
for (i=1; i<=n; i++)
{
scanf("%d",&k);
rmc[i][0]=k;
}
for (k=0; k<=n; k++) if ((1<<(k+1))>n) break;
for (j=1; j<=k; j++)
for (i=1; i<=n; i++)
{
min=rmc[i][j-1];
if (rmc[i+(1<<(j-1))][j-1]<min) min=rmc[i+(1<<(j-1))][j-1];
rmc[i][j]=min;
}
for (i=1; i<=m; i++)
{
scanf("%d %d",&p,&q);
for (k=0; k<=n; k++)
if ((1<<(k+1))>q-p) break;
min=rmc[p][k];
if (rmc[q-(1<<k)+1][k]<min) min=rmc[q-(1<<k)+1][k];
printf("%d\n",min);
}
return 0;
}