Pagini recente » Cod sursa (job #509445) | Cod sursa (job #1719400) | Cod sursa (job #2271387) | Cod sursa (job #714065) | Cod sursa (job #1527372)
#include <fstream>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
const int NMAX=100005;
int Rmq[18][NMAX],n,m,log[NMAX],a[NMAX];
inline void RMQ()
{
for(int i=1;i<=n;i++)
Rmq[0][i]=a[i];
for(int i=2;i<=n;i++)
log[i]=1+log[i/2];
for(int i=1;(1<<i)<=n;i++)
for(int j=1;j+(1<<i)-1<=n;j++)
Rmq[i][j]=min(Rmq[i-1][j],Rmq[i-1][j+(1<<(i-1))]);
}
int main()
{
int x,y;
f>>n>>m;
for(int i=1;i<=n;i++)
f>>a[i];
RMQ();
for(int i=1;i<=m;i++)
{
f>>x>>y;
int lng=y-x+1;
int lg=log[lng];
int a=Rmq[lg][x];
int b=Rmq[lg][y-(1<<lg)+1];
int sol=min(a,b);
g<<sol<<"\n";
}
return 0;
}