Pagini recente » Cod sursa (job #575389) | Cod sursa (job #932908) | Cod sursa (job #635156) | Cod sursa (job #2598017) | Cod sursa (job #3142547)
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
const int N=1e5;
int rmq[17][N+11],logog[N+11];
int query(int x,int y)
{
int l=logog[y-x+1];
return min(rmq[l][y],rmq[l][x+(1<<l)-1]);
}
int main()
{
int n,m,i,j,x,y;
fin>>n>>m;
for(i=2;i<=N;i++)
logog[i]=logog[i/2]+1;
for(i=1;i<=n;i++)
fin>>rmq[0][i];
for(j=1;j<=n;j++)
for(i=(1<<j);i<=n;i++)
rmq[j][i]=min(rmq[j-1][i],rmq[j-1][i-(1<<(j-1))]);
for(i=1;i<=m;i++)
{
fin>>x>>y;
fout<<query(x,y)<<'\n';
}
return 0;
}