Pagini recente » Rating Olar Razvan (olahus) | Cod sursa (job #2952369) | Monitorul de evaluare | Cod sursa (job #2149796) | Cod sursa (job #2870845)
#include <bits/stdc++.h>
#define nmax 100001
#define lmax 18
using namespace std;
ifstream f ("rmq.in");
ofstream g ("rmq.out");
long int rmq[lmax][nmax];
long int n,m;
long int lg[nmax];
long int a[nmax];
int main()
{
long int i,j,l;
f>>n>>m;
for(i=1;i<=n;i++)
f>>a[i];
lg[1]=0;
for(i=2;i<=n;i++)
lg[i]=lg[i/2]+1;
for(i=1;i<=n;i++)
rmq[0][i]=a[i];
for(i=1;(1<<i)<=n;i++)
for(j=1;j<=n-(1<<i)+1;j++)
{
l=1<<(i-1);
rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+l]);
}
long int x,y,dif,sh;
for(i=1;i<=m;i++)
{
f>>x>>y;
dif=y-x+1;
l=lg[dif];
sh=dif-(1<<l);
g<<min(rmq[l][x],rmq[l][x+sh])<<'\n';
}
return 0;
}