Pagini recente » Cod sursa (job #2935455) | Cod sursa (job #3138591) | Cod sursa (job #272525) | Cod sursa (job #3004479) | Cod sursa (job #2535340)
#include <fstream>
#include <vector>
using namespace std;
#define NMAX 100002
#define LMAX 18
long int rmq[LMAX][NMAX];
long int n,m;
long int lg[NMAX];
long int a[NMAX];
ifstream cin("rmq.in");
ofstream cout("rmq.out");
int main()
{
long int i,j,l;
cin>>n>>m;
for(i=1; i<=n; i++)
cin>>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,diff,sh;
for(i=1; i<=m; i++)
{
cin>>x>>y;
diff=y-x+1;
l=lg[diff];
sh=diff-(1<<l);
cout<<min(rmq[l][x],rmq[l][x+sh])<<"\n";
}
return 0;
}