Pagini recente » Cod sursa (job #2803853) | Cod sursa (job #2264537)
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int v[100002];
int rmq[17][100002],n,m,i,nr,j,x,y,k;
long long p;
int main()
{
f>>n>>m;
for (i=1;i<=n;i++)
{
f>>v[i];
}
nr=log2(n);
for (i=1;i<=n;i++)
{
rmq[0][i]=v[i];
}
p=1;
for (j=1;j<=nr;j++)
{
for (i=1;i<=n-(1<<j)+1;i++)
{
rmq[j][i]=min(rmq[j-1][i],rmq[j-1][i+p]);
}
p=p*2;
}
for (j=1;j<=m;j++)
{
f>>x>>y;
if (x==y)
{
g<<rmq[0][x]<<'\n';
continue;
}
k=log2(y-x);
g<<min(rmq[k][x],rmq[k][y-(1<<k)+1])<<'\n';
}
return 0;
}