Pagini recente » Cod sursa (job #1504832) | Cod sursa (job #2092948)
#include<stdio.h>
#include<algorithm>
#include<limits.h>
#define MAXN 131072
#define MAXLOG 18
#define INF INT_MAX
void precalc(int N);
FILE*fin,*fout;
int d[MAXN+1][MAXLOG+1];
int Log[MAXN+1];
int val[MAXN+1];
int main()
{
fin=fopen("rmq.in","r");
fout=fopen("rmq.out","w");
int N,Q;
fscanf(fin,"%d%d",&N,&Q);
for(int i=1; i<=N; i++)
{
fscanf(fin,"%d",val+i);
}
precalc(N);
for(int i=1; i<=Q; i++)
{
int x,y;
fscanf(fin,"%d%d",&x,&y);
int k=Log[y-x+1];
fprintf(fout,"%d\n",std::min(d[k][x],d[k][y-(1<<k)+1]));
}
fclose(fin);
fclose(fout);
return 0;
}
void precalc(int N)
{
Log[1]=0;
for(int i=2; i<=N; i++)
{
Log[i]=1+Log[i>>1];
}
for(int j=1; j<=N; j++)
{
d[0][j]=val[j];
}
int pow=1;
for(int i=1; i<=Log[N]+1; i++)
{
for(int j=1; j+2*pow-1<=N; j++)
{
d[i][j]=std::min(d[i-1][j],d[i-1][j+pow]);
}
pow>>=1;
}
}