Pagini recente » Cod sursa (job #2112351) | Cod sursa (job #3175289) | Cod sursa (job #1360555) | Cod sursa (job #280385) | Cod sursa (job #2592897)
#include<fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
const int Nmax=100002;
const int Lmax=19;
long long rmq[Lmax][Lmax],m,n,lg[Nmax],v[Nmax];
inline long long mini(long long a, long long b)
{
if(a<b)
return a;
else return b;
}
int main()
{
long long i,j,l;
fin>>n>>m;
for (i=1;i<=n;i++)
fin>>v[i];
lg[1]=0;
for (i=2;i<=n;i++)
lg[i]=lg[i/2]+1;
for (i=1;i<=n;i++)
rmq[0][i]=v[i];
for(int i=1;i<=Lmax;i++)
{
for(int j=1;j+(1<<(i-1))-1<=n;j++)
{
rmq[i][j]=mini(rmq[i-1][j],rmq[i-1][j+(1<<(i-1))]);
}
}
long long x,y;
for (i=1;i<=m;i++)
{
fin>>x>>y;
l=lg[y-x+1];
fout<<mini(rmq[l][x],rmq[l][x-1+(1<<l)])<<'\n';
}
fin.close();
fout.close();
return 0;
}