Pagini recente » Cod sursa (job #3286920) | Cod sursa (job #2220365) | Cod sursa (job #2643370) | Cod sursa (job #3163857) | Cod sursa (job #2480978)
#include <fstream>
using namespace std;
const int MAX=100001;
ifstream in("rmq.in");
ofstream out("rmq.out");
int r[20][MAX],log[MAX],n,m,p,q,l;
void logaritm()
{
log[1]=0;
for(int i=2;i<=n;i++) log[i]=1+log[i/2];
}
int main()
{
in>>n>>m;
for(int i=0;i<n;i++) in>>r[0][i];
logaritm();
for(int i=1;i<=log[n];i++)
{
for(int j=0;j+(1<<i)<=n;j++)
{
r[i][j]=min(r[i-1][j],r[i-1][j+(1<<(i-1))]);
}
}
for(int i=1;i<=m;i++)
{
in>>p>>q;
p--;
q--;
l=log[q-p+1];
out<<min(r[l][p],r[l][q-(1<<l)+1])<<"\n";
}
return 0;
}