Pagini recente » Cod sursa (job #2042424) | Cod sursa (job #3203227) | Cod sursa (job #635650) | Cod sursa (job #2498473) | Cod sursa (job #1970809)
#include <bits/stdc++.h>
#define DIM 10000
using namespace std;
int n,m,i,j,a[20][100010],Log[100010],k,l,r,A,B,aux,d,poz;
char buff[DIM];
void citeste(int &nr)
{
nr=0;
while(buff[poz]<'0'||buff[poz]>'9')
if(++poz==DIM)poz=0,fread(buff,1,DIM,stdin);
while(buff[poz]>='0'&&buff[poz]<='9')
{
nr=nr*10+buff[poz]-'0';
if(++poz==DIM)poz=0,fread(buff,1,DIM,stdin);
}
}
int main()
{
freopen("rmq.in","r",stdin);
freopen("rmq.out","w",stdout);
citeste(n);
citeste(m);
for(i=1; i<=n; ++i)
citeste(a[0][i]);
for(i=2; i<=n; ++i)
Log[i]=Log[i/2]+1;
for(i=1; i<=Log[n]; ++i)
for(j=1; j<=n; ++j)
{
aux=(1<<(i-1));
A=a[i-1][j];
B=a[i-1][j-aux];
a[i][j]=min(A,B);
}
++m;
while(--m)
{
citeste(l);
citeste(r);
d=r-l+1;
aux=d-(1<<Log[d]);
A=a[Log[d]][r];
B=a[Log[d]][r-aux];
printf("%d\n",min(A,B));
}
return 0;
}