Pagini recente » Cod sursa (job #2239560) | Cod sursa (job #3292799) | Cod sursa (job #128952) | Cod sursa (job #684130) | Cod sursa (job #1045462)
#include<fstream>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n,d,l,m,x,y,i,j,k,lg[100003],a[100002][20];
int main()
{
f>>n>>m;
for(i=1;i<=n;++i)
f>>a[i][0];
for(i=2;i<=n;++i)
lg[i]=lg[i>>1]+1;
for(k=1;(1<<k)<=n;++k)
{
for(j=1;j<=n-(1<<k)+1;++j)
a[j][k]=min(a[j][k-1],a[j+(1<<(k-1))][k-1]);
}
for(;m;--m)
{
f>>x>>y;
d=y-x+1;
l=lg[d];
g<<min(a[x][l],a[x+d-(1<<l)][l])<<'\n';
}
g<<endl;
for(i=1;i<=200;i++)
{
for(j=1;j<=20;j++)
g<<a[i][j]<<" ";
g<<endl;
}
return 0;
}