Pagini recente » Cod sursa (job #990287) | Cod sursa (job #1810923) | Cod sursa (job #119870) | Cod sursa (job #731704) | Cod sursa (job #3203233)
#include <fstream>
#include <cmath>
#include <vector>
using namespace std;
ifstream cin("rmq.in");
ofstream cout("rmq.out");
int n,q,l;
int st,dr;
vector<vector<int>> rmq;
vector<int> E;
int main()
{
cin>>n>>q;
l=log2(n);
rmq.resize(l+1);
rmq[0].resize(n);
for(int i=0;i<n;i++)
cin>>rmq[0][i];
for(int p=1;(1<<p)<n;p++)
{
rmq[p].resize(n);
for(int i=0;i<n;i++)
{
rmq[p][i]=rmq[p-1][i];
int j=i+(1<<(p-1));
if(j<n)
rmq[p][i]=min(rmq[p][i],rmq[p-1][j]);
}
}
E.resize(n+1);
for(int i=2;i<=n;i++)
E[i]=E[i/2]+1;
for(int i=0;i<q;i++)
{
cin>>st>>dr;
st--;
dr--;
int l=dr-st+1;
int pt=(1<<E[l]);
cout<<min(rmq[E[l]][st],rmq[E[l]][dr-pt+1])<<'\n';
}
return 0;
}