Pagini recente » Cod sursa (job #2339353) | Cod sursa (job #2483673) | Cod sursa (job #600792) | Cod sursa (job #2232948) | Cod sursa (job #2348268)
#include<cstdio>
#define M 5000000
#define N(x,y) (x<y?x:y)
int n,m,i,j,b[18][100001],c[100001],o,l;
char r[M];
int A()
{
int s=0;
for(;r[o]<'0'||r[o]>'9';o++);
for(;r[o]>='0'&&r[o]<='9';o++)
s=s*10+r[o]-'0';
return s;
}
void S(int b)
{
char e[100];
int j;
for(j=0;b;b/=10,j++)
e[j]=b%10+48;
for(j--;j>=0;j--)
r[l++]=e[j];
r[l++]='\n';
}
int main()
{
freopen("rmq.in","r",stdin),freopen("rmq.out","w",stdout),fread(r,1,M,stdin),n=A(),m=A();
for(i=1;i<=n;i++)
b[0][i]=A();
for(i=2;i<=n;i++)
c[i]=c[i/2]+1;
for(i=1;(1<<i)<=n;i++)
for(j=1;j<=n+1-(1<<i);j++)
b[i][j]=N(b[i-1][j],b[i-1][j+(1<<(i-1))]);
while(m--)
i=A(),j=A(),n=c[j-i+1],S(N(b[n][i],b[n][j+1-(1<<n)]));
fwrite(r,1,l,stdout);
}