Pagini recente » Cod sursa (job #573960) | Cod sursa (job #489922) | Cod sursa (job #2853288) | Cod sursa (job #901409) | Cod sursa (job #2754008)
#include <fstream>
using namespace std;
long int a[10002],lg[10002],rmq[18][10002];
int main()
{
ifstream fin("rmq.in");
ofstream fout("rmq.out");
long int n,m;
fin>>n>>m;
for(int i=1;i<=n;i++)
fin>>a[i];
lg[1]=0;
for (int i=2;i<=n;i++)
lg[i]=lg[i/2]+1;
for (int i=1;i<=n;i++)
rmq[0][i]=a[i];//pentru intervale de lungime 0
int l;
for(int i=1;(1<<i)<=n;i++)
for(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 long x,y,diff,sh;
for(int i=1;i<=m;i++)
{
fin>>x>>y;
diff=y-x+1;//marimea intervalului
l=lg[diff];
sh=diff- (1<<l) ;
fout<<min(rmq[l][x],rmq[l][x+sh])<<'\n';
}
return 0;
}