Pagini recente » Cod sursa (job #2210045) | Cod sursa (job #146496) | Monitorul de evaluare | Cod sursa (job #1409124) | Cod sursa (job #2854864)
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
const int NMAX=1e5+5,LOGMAX=18;
int v[LOGMAX][NMAX],log[NMAX];
int main()
{
int n,m;
fin.tie(0);
fin>>n>>m;
log[1]=0;
for(int i=2;i<=n;i++)
{
log[i]=log[i>>1]+1;
}
for(int i=1;i<=n;i++)
{
fin>>v[0][i];
}
for(int i=1;(1<<i)<=n;i++)
{
for(int j=1;j<=n-(1<<i)+1;j++)
{
v[i][j]=min(v[i-1][j],v[i-1][j+(1<<(i-1))]);
}
}
for(int i=1;i<=m;i++)
{
int mn,mx,diff,logg;
fin>>mn>>mx;
diff=mx-mn+1;
logg=log[diff];
fout<<min(v[logg][mn],v[logg][mn+diff-(1<<logg)])<<endl;
}
fout.flush();
return 0;
}