Pagini recente » Cod sursa (job #2384886) | Cod sursa (job #1851311) | Cod sursa (job #1101688) | Cod sursa (job #429356) | Cod sursa (job #1766389)
#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
long int i,j,k,m,n,nr,rmq[18][100005],x,y,dif,dis,l,ram[100005];
int main()
{
fin>>n>>m;
for(i=1;i<=n;i++)
{
fin>>rmq[0][i];
}
//ram[1]=0;
for(i=2;i<=n;i++)
{
ram[i]=ram[i/2]+1;
}
for(i=1;(1<<i)<=n;i++)
{
for(j=1;j+(1<<(i-1))<=n;++j)
{
rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+(1<<(i-1))]);
}
}
for(i=1;i<=m;i++)
{
fin>>x>>y;
dif=y-x+1;
l=ram[dif];
//k=dif-(1<<l);
fout<<min(rmq[l][x],rmq[l][y-(1<<l)+1])<<"\n";
}
}