Pagini recente » Cod sursa (job #3132060) | Cod sursa (job #2007433) | Cod sursa (job #2225819) | Cod sursa (job #1794701) | Cod sursa (job #3339160)
#include <fstream>
#include <math.h>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n, m, i, rmq[35][100005], nr, st, dr;
int main()
{
fin>>n>>m;
for(i=1; i<=n; i++)
fin>>rmq[0][i];
int p=2;
while(p<=n)
{
nr++;
for(int i=1; i<=n-p+1; i++)
rmq[nr][i]=min(rmq[nr-1][i], rmq[nr-1][i+p/2]);
p*=2;
}
while(m--)
{
fin>>st>>dr;
int lg=dr-st+1;
int pow2=log2(lg);
fout<<min(rmq[pow2][st], rmq[pow2][dr-(1<<pow2)+1])<<'\n';
}
return 0;
}