Pagini recente » Cod sursa (job #989067) | Cod sursa (job #2613733) | Cod sursa (job #539132) | Cod sursa (job #709830) | Cod sursa (job #215346)
Cod sursa(job #215346)
#include <stdio.h>
#include <math.h>
#define DIM 100002
int V[DIM],Log[DIM];
int M[DIM][30];
int n,m,i,j,log1,a,b,dljm1,dlLog1;
int main(){
FILE *f = fopen("rmq.in","r");
fscanf(f,"%d %d",&n,&m);
fscanf(f,"%d",&V[1]);
M[1][0] = V[1];
for (i=2;i<=n;i++) {
fscanf(f,"%d",&V[i]);
M[i][0] = V[i];
Log[i]=Log[i>>1]+1;
}
/* for(i=2;i<=n;++i)
Log[i]=Log[i>>1]+1;
for (i=1;i<=n;i++)
*/
for (j=1;(1<<j)<=n;j++) {
dljm1 = 1<<(j-1);
for (i=1;i+(1<<j)-1<=n;i++) {
if (M[i][j-1]<M[i+(dljm1)][j-1])
M[i][j] = M[i][j-1];
else
M[i][j] = M[i+(dljm1)][j-1];
}
}
FILE *g = fopen("rmq.out","w");
for (i=1;i<=m;i++) {
fscanf(f,"%d %d",&a, &b);
// for (log1=0;(1<<log1)<=(b-a+1);log1++);
// log1--;
log1 = Log[b-a+1];
dlLog1 = (1<<log1);
if (M[a][log1]<M[b-(dlLog1)+1][log1]) {
fprintf(g,"%d\n",M[a][log1]);
} else {
fprintf(g,"%d\n",M[b-(dlLog1)+1][log1]);
}
}
fclose(g);
fclose(f);
return 0;
}