Pagini recente » Cod sursa (job #2575487) | Cod sursa (job #854883) | Cod sursa (job #369119) | Cod sursa (job #2927693) | Cod sursa (job #1529749)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
long n,m;
long a[100002];
long lg[100002] , rmq[18][100002] ;
int main()
{
long i,j,l;
fin>>n>>m;
for(i=1;i<=n;++i)
fin>>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 x,y,dif,sh;
for (i=1;i<=m;i++)
{
fin>>x>>y;
dif=y-x+1;
l=lg[dif];
sh= dif - (1<<l);
fout<< min(rmq[l][x],rmq[l][x+sh])<<'\n' ;
}
return 0;
}