Pagini recente » Cod sursa (job #3233213) | Cod sursa (job #1967752) | Cod sursa (job #1231703) | Cod sursa (job #785723) | Cod sursa (job #3161473)
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int rmq[31][100001],n,m,x,y,e[100001];
int main()
{
fin>>n>>m;
for(int i=1;i<=n;i++)
fin>>rmq[0][i];
e[1]=0;
for(int i=2;i<=n;i++)
{
e[i]=e[i/2]+1;
}
for(int p=1;(1<<p)<=n;p++)
{
for(int i=1;i<=n;i++)
{
if(rmq[p-1][i+(1<<(p-1))]==0)
rmq[p][i]=rmq[p-1][i];
else
rmq[p][i]=min(rmq[p-1][i],rmq[p-1][i+(1<<(p-1))]);
}
}
for(int i=1;i<=m;i++)
{
fin>>x>>y;
int p=e[y-x+1];
fout<<min(rmq[p][x],rmq[p][y-(1<<p)+1])<<"\n";
}
return 0;
}