Pagini recente » Cod sursa (job #530242) | Cod sursa (job #776235) | Cod sursa (job #1315358) | Cod sursa (job #132239) | Cod sursa (job #1204687)
#include <fstream>
using namespace std;
int n,m,rmq[100005][20],put[20],apr[100005],a[100005],x,y;
int main()
{
ifstream in ("rmq.in");
ofstream out ("rmq.out");
in>>n>>m;
for (int i=1;i<=n;++i) in>>a[i];
put[0]=1;
for (int i=1;i<20;++i) put[i]=put[i-1]*2;
apr[0]=0;
for (int i=1;i<100005;++i) { apr[i]=apr[i-1]; if (put[apr[i]+1]==i) apr[i]++; }
for (int i=n;i>0;--i)
{
rmq[i][0]=a[i];
for (int j=1; j<=17;++j)
{
if (i+put[j]-1<=n)
{
rmq[i][j]=rmq[i][j-1];
if (rmq[i+put[j-1]][j-1]<rmq[i][j]) rmq[i][j]=rmq[i+put[j-1]][j-1];
}
}
}
for (int i=1;i<=m;++i)
{
in>>x>>y;
if (y<x) { int t=x; x=y; y=t; }
int dif=y-x+1,minim;
minim=rmq[x][apr[dif]];
if (minim>rmq[y-put[apr[dif]]+1][apr[dif]]) minim=rmq[y-put[apr[dif]]+1][apr[dif]];
out<<minim<<"\n";
}
in.close();
out.close();
return 0;
}