Pagini recente » Cod sursa (job #536843) | Cod sursa (job #2359607) | Cod sursa (job #2839927) | Cod sursa (job #2788038) | Cod sursa (job #430027)
Cod sursa(job #430027)
#include<stdio.h>
FILE *f,*g;
int i,put[30],n,a[100500],m[100500][25],ok,j,p,x,y,min,k,log[100500],o;
inline int minim(int a,int b)
{ if(a<b) return a; return b; }
int main()
{ f=fopen("rmq.in","r"); g=fopen("rmq.out","w");
put[0]=1; for(i=1;i<=20;i++) put[i]=put[i-1]*2;
fscanf(f,"%d%d",&n,&p);
log[1]=0; for(i=2;i<=n;i++) log[i]=log[i/2]+1;
for(i=1;i<=n;i++) fscanf(f,"%d",&m[i][0]);
for(j=1; (1<<j)<=n; j++) for(i=1; i+(1<<j)<=n; i++) m[i][j]=minim(m[i][j-1],m[i+put[j-1]][j-1]);
for(i=1;i<=p;i++)
{ fscanf(f,"%d%d",&x,&y);
k=log[y-x+1]; o=minim(m[x][k],m[y+1-(1<<k)][k]);
fprintf(g,"%d\n",o);
}
fclose(g);
return 0;
}