Pagini recente » Cod sursa (job #955723) | Cod sursa (job #1779349) | Cod sursa (job #2879418) | Cod sursa (job #2288167) | Cod sursa (job #2042345)
#include<fstream>
//#include<iostream>
#include<cmath>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int rmq[100002][18], n, m, v[100005];
int main ()
{
fin>>n>>m;
for(int i=1; i<=n;++i)
{
fin>>v[i];
rmq[i][0]=v[i];
}
for(int j=1;j<=18;++j)
{
for(int i=1;i+(1<<j)-1<=n;++i)
{
rmq[i][j]=min(rmq[i][j-1], rmq[i+(1<<(j-1))][j-1]);//(1<<j)=2^j*1
}
}
for(int i=1; i<=m;++i)
{
int st, dr;
fin>>st>>dr;
int k=log2(dr-st+1);
fout<<min(rmq[st][k],rmq[dr-(1<<k)+1][k]);
}
}