Pagini recente » Cod sursa (job #1698940) | Cod sursa (job #1073757) | Cod sursa (job #2149165) | Cod sursa (job #2204927) | Cod sursa (job #2284679)
#include <bits/stdc++.h>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int rmq[20][100001], n,m,a[100001],i,j,l,p,x,y;
int main()
{
f>>n>>m;
for(i=1; i<=n; i++)
f>>a[i];
for(i=1; i<=n; i++)
rmq[0][i]=a[i];
for(i=1; (1<<i)<=n; i++)
{
for(j=1; j<= n-(1<<i)+1; j++)
{
l=1<<(i-1);
rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+l]);
}
}
for(i=1;i<=m;i++)
{
f>>x>>y;
l=x-y+1;
p=log2(l);
g<<min(rmq[p][x],rmq[p][y-(1<<p)+1])<<'\n';
}
return 0;
}