Pagini recente » Cod sursa (job #2967471) | Cod sursa (job #2808437) | Cod sursa (job #647690) | Cod sursa (job #722819) | Cod sursa (job #2766775)
#include <bits/stdc++.h>
#define nmax 100000
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int rmq[nmax][30],lg[nmax],n,m;
int main()
{
f>>n>>m;
for(int i=1;i<=n;i++)
{
f>>rmq[i][0];
}
lg[1]=0;
for(int i=2;i<=n;i++)
{
lg[i]=lg[i/2]+1;
//g<<lg[i]<<' ';
}
//g<<'\n';
for(int i=1;(1<<i)<=n;i++)
{
for(int j=1;j<=n-(1<<i)+1;j++)
{
rmq[j][i]=min(rmq[j][i-1],rmq[j+(1<<(i-1))][i-1]);
//g<<rmq[j][i]<<' ';
}
//g<<'\n';
}
for(int i=0;i<m;i++)
{
int a,b;
f>>a>>b;
int l=lg[b-a];
g<<min(rmq[a][l],rmq[b-(1<<l)+1][l])<<'\n';
}
return 0;
}