Pagini recente » Cod sursa (job #310090) | Diferente pentru autumn-warmup-2007/solutii/runda-3 intre reviziile 53 si 27 | Cod sursa (job #717849) | Diferente pentru rotatie-lexicografic-minima intre reviziile 22 si 38 | Cod sursa (job #1246564)
#include <stdio.h>
#include <math.h>
long int d[18][100000];
int main()
{
long int n,m,nr,x,y,count=0,use=1,min=100000;
bool flag=0;
FILE *fin,*fout;
fin=fopen("rmq.in","r");
fout=fopen("rmq.out","w");
fscanf(fin,"%ld %ld",&n,&m);
for(int i=0;i<n;i++)
{
fscanf(fin,"%ld",&d[0][i]);//fscanf(fisier,"%d(ecimal)",&-adresa de citire);
}
for(int i=1;i<17;i++)
{
nr=i-1;
nr=pow(2,nr);
for(int j=0;d[i-1][j+nr]!=0;j++)
{
if(d[i-1][j]<d[i-1][j+nr])
{
d[i][j]=d[i-1][j];
}
else
{
d[i][j]=d[i-1][j+nr];
}
}
}
for(long int k=0;k<m;k++)
{
flag=0;
fscanf(fin,"%ld %ld",&x,&y);
count=0;
use=1;
while(use<=y-x)
{
count++;
use*=2;
flag=1;
}
if(flag==1)
{
count--;
}
use/=2;
use=y-x-use+1;
min=100000;
for(long int j=x-1;j<=x+use-1;j++)
{
if(min>d[count][j])
{
min=d[count][j];
}
}
fprintf(fout,"%ld",min);
if(k!=m-1)
{
fprintf(fout,"\n");
}
}
}