Pagini recente » Cod sursa (job #624223) | Cod sursa (job #1078639) | Cod sursa (job #2404567) | Cod sursa (job #2119898) | Cod sursa (job #1805499)
#include <cstdio>
#define min(a,b) (a<b?a:b)
int a[100010][20];
int main()
{
FILE *f=fopen("rmq.in","r"),*g=fopen("rmq.out","w");
int n,m,i,j,p,x,y;
fscanf(f,"%d%d",&n,&m);
for(j=1;j<=n;j++)fscanf(f,"%d",&a[0][j]);
p=2;i=1;
while(p<=n)
{
for(j=1;j+p-1<=n;j++)
a[i][j]=min(a[i-1][j],a[i-1][j+(p>>1)]);
i++;p=(p<<1);
}
while(m)
{
m--;
fscanf(f,"%d%d",&x,&y);
int l=y-x+1;
p=1,i=0;
while(p<=l){p=(p<<1);i++;}
p/=2;i--;
fprintf(g,"%d\n",min(a[i][x],a[i][y-p+1]));
}
return 0;
}