Pagini recente » Cod sursa (job #1505616) | Monitorul de evaluare | Cod sursa (job #2587838) | Cod sursa (job #2616175) | Cod sursa (job #2157506)
#include <cstdio>
#include <algorithm>
#define MAXN 100001
int r[MAXN][17],v[MAXN],lg[MAXN];
int main()
{
FILE *fin,*fout;
fin=fopen("rmq.in","r");
fout=fopen("rmq.out","w");
int n,m,a,b,l;
fscanf(fin,"%d%d",&n,&m);
for(int i=1;i<=n;i++)
fscanf(fin,"%d",&v[i]);
for(int i=1;i<=n;i++)
{
r[i][0]=v[i];
for(int j=1;(1<<j)<=i;j++)
r[i][j]=std::min(r[i][j-1],r[i-(1<<(j-1))][j-1]);
}
for(int i=2;i<=n;i++)
lg[i]=1+lg[i>>1];
for(int i=0;i<m;i++)
{
fscanf(fin,"%d%d",&a,&b);
l=lg[b-a+1];
fprintf(fout,"%d\n",std::min(r[b][l],r[a+(1<<l)-1][l]));
}
fclose(fin);
fclose(fout);
return 0;
}