Pagini recente » Cod sursa (job #2079166) | Cod sursa (job #316714) | Cod sursa (job #1762549) | Cod sursa (job #1917966) | Cod sursa (job #2137984)
#include <bits/stdc++.h>
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
const int nx=100002;
int rmq[19][nx];
int lg[nx],x,y,secv,n,m;
int main()
{
in>>n>>m;
for(int i=1; i<=n; i++)
{
in>>rmq[0][i];
if(i>=2)
lg[i]=lg[i/2]+1;
}
for(int i=1; (1<<i)<=n; i++)
for(int j=1; j<=n-(1<<(i-1)); j++)
rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+(1<<(i-1))]);
for(;m;m--)
{
in>>x>>y;
secv=y-x+1;
out<<min(rmq[lg[secv]][x],rmq[lg[secv]][y-(1<<lg[secv])+1])<<'\n';
}
return 0;
}