Pagini recente » Cod sursa (job #1663720) | Cod sursa (job #921342) | Cod sursa (job #956373) | Cod sursa (job #1038756) | Cod sursa (job #3161457)
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int rmq[31][100001],n,m,x,y,p[31];
int main()
{
fin>>n>>m;
for(int i=1;i<=n;i++)
fin>>rmq[1][i];
p[1]=1;
for(int i=2;p[i]<=n;i++)
{
p[i]=p[i-1]*2;
}
for(int k=2;p[k]<=n;k++)
{
for(int i=1;i<=n;i++)
{
rmq[k][i]=min(rmq[k-1][i],rmq[k-1][i+p[k-1]+1]);
}
}
for(int i=1;i<=m;i++)
{
fin>>x>>y;
int k;
for(k=1;p[k+1]<=y-x;k++);
fout<<min(rmq[k][x],rmq[k][y-p[k]])<<"\n";
}
return 0;
}