Pagini recente » Cod sursa (job #3268955) | Cod sursa (job #2620326) | Cod sursa (job #2812291) | Cod sursa (job #1841407) | Cod sursa (job #3161477)
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
#define NMAX 100002
#define LMAX 18
long int rmq[LMAX][NMAX];
long int n,m;
long int lg[NMAX];
long int a[NMAX];
int main()
{
long int 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 int x,y,diff,sh;
for (i=1;i<=m;i++)
{
fin>>x>>y;
diff=y-x+1;
l=lg[diff];
sh=diff - (1<<l);
fout<<min(rmq[l][x],rmq[l][x+sh])<<"\n";
}
return 0;
}