Pagini recente » Cod sursa (job #780525) | Cod sursa (job #793954) | Cod sursa (job #1781793) | Cod sursa (job #235142) | Cod sursa (job #2606625)
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
const int N=100001, L = 17;
int n,m,x,y,ans;
int log2[N];
int rmq[L][N];
int main()
{
fin>>n>>m;
for(int i=1;i<=n;i++)
{
fin>>x;
rmq[0][i]=x;
}
log2[1]=0;
for(int i=2;i<=n;i++)
{
log2[i]=1+log2[i/2];
}
for(int i=1;i<=log2[n];i++)
{
for(int j=1<<i;j<=n;j++)
{
int jj=j-(1<<(i-1));
rmq[i][j]=min(rmq[i-1][jj],rmq[i-1][j]);
}
}
for(int i=1;i<=m;i++)
{
fin>>x>>y;
int l=log2[y-x+1];
int pp=x+(1<<l)-1;
ans=min(rmq[l][pp],rmq[l][y]);
//fout<<x<<" "<<y<<" "<<pp<<" "<<rmq[l][pp]<<" "<<rmq[l][y]<<" ";
fout<<ans<<'\n';
}
return 0;
}