Pagini recente » Cod sursa (job #1893694) | Cod sursa (job #159254) | Cod sursa (job #1571903) | Cod sursa (job #3247571) | Cod sursa (job #2754606)
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("rmg.in");
ofstream g("rmq.out");
const int NMAX=100001;
const int LMAX=18;
long int rmq[LMAX][NMAX];
long int n,m;
long int lg[NMAX];
long int a[NMAX];
int main(){
long int l;
f>>n>>m;
for(long int i=1;i<=n;i++)
f>>a[i];
lg[1]=0;
for(long int i=2;i<=n;i++)
lg[i]=lg[i/2]+1;
for(long int i=1;i<=n;i++)
rmq[0][i]=a[i];
for(long int i=1;(1<<i)<=n;i++)
for(long int j=1;j<=n-(1<<i)+1;j++)
{
l=1<<(i-1);
rmq[i][j]=min(rmq[i-1][j], rmq[i-1][j+1]);
}
long int x,y,diff,sh;
for(long int i=1;i<=m;i++)
{
f>>x>>y;
diff=y-x+1;
l=lg[diff];
sh=diff-(1<<l);
cout<<min(rmq[l][x],rmq[l][x+sh])<<endl;
}
return 0;
}