Pagini recente » Cod sursa (job #1716518) | Cod sursa (job #3272807) | Cod sursa (job #2256137) | Cod sursa (job #3248944) | Cod sursa (job #1812110)
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int rmq[100001][25];
int main()
{
int n,m,i,p2,j,x,y,dif;
fin>>n>>m;
for(i=1;i<=n;i++)
fin>>rmq[i][0];
i=0;p2=1;j=1;
while(p2<=n)
{
for(i=1;i+p2<=n;i++)
rmq[i][j]=min(rmq[i][j-1],rmq[i+p2][j-1]);
p2=p2*2;
j++;
}
for(i=1;i<=m;++i)
{
fin>>x>>y;
dif=y-x;
p2=1;j=0;
while(dif>0)
{
dif-=p2;
p2=p2*2;j++;
}
if(x!=y){p2/=2;j--;}
fout<<min(rmq[x][j],rmq[y-p2+1][j])<<'\n';
}
return 0;
}