Pagini recente » Cod sursa (job #3194387) | Cod sursa (job #1327598) | Cod sursa (job #3194383) | Cod sursa (job #1198778) | Cod sursa (job #440402)
Cod sursa(job #440402)
#include<stdio.h>
#define min(a,b) a<b?a:b
int lg[100005],v[20][100005],n,m,i,ll,l,j,x,y;
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",&v[0][i]);
for(i=2;i<=n;i++)
lg[i]=lg[i/2]+1;
for(i=1;i<=lg[n];i++)
for(j=1;i<=lg[n+1-j];j++)
v[i][j]=min(v[i-1][j],v[i-1][j+(1<<(i-1))]);
for(i=1;i<=m;i++)
{
scanf("%d %d",&x,&y);
ll=lg[y-x+1];
printf( "%d\n",min( v[ll][x]<v[ll][y+1-(1<<ll)] ) );
}
return 0;
}