Pagini recente » Cod sursa (job #129713) | Cod sursa (job #2068866) | Cod sursa (job #461498) | Cod sursa (job #958791) | Cod sursa (job #178875)
Cod sursa(job #178875)
#include <stdio.h>
inline int minc(int x,int y)
{
if (x<y)
return x;
return y;
}
int a[100005][35],b[100005],log[100005],puteri[40];
int main()
{
int n,m,i,j,x,put,y;
FILE *in,*out;
in=fopen("rmq.in","r");
out=fopen("rmq.out","w");
fscanf(in,"%d%d",&n,&m);
for (i=1;i<=n;i++)
{
fscanf(in,"%d",&b[i]);
}
log[1]=0;
x=1;
put=0;
puteri[0]=1;
for (i=2;i<=100000;i++)
{
if (x*2<=i)
{
x*=2;
put++;
puteri[put]=x;
}
log[i]=put;
}
puteri[put+1]=x*2;
for (i=n;i>=1;i--)
{
a[i][0]=b[i];
printf("%d ",a[i][0]);
for (j=1;i+puteri[j]<=n+1;j++)
{
a[i][j]=minc(a[i][j-1],a[i+puteri[j-1]][j-1]);
printf("%d ",a[i][j]);
}
printf("\n");
}
for (i=1;i<=m;i++)
{
fscanf(in,"%d%d",&x,&y);
fprintf(out,"%d\n",minc(a[x][log[y-x+1]],a[y-puteri[log[y-x+1]]+1][log[y-x+1]]));
}
fclose(in);
fclose(out);
return 0;
}