Pagini recente » Cod sursa (job #1910595) | Cod sursa (job #1950812) | Cod sursa (job #2954356) | Cod sursa (job #3338959) | Cod sursa (job #3343794)
#include <fstream>
#include <math.h>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n, m, i, j, x, y, rmq[21][100005];
int main()
{
fin>>n>>m;
for(i=1; i<=n; i++)
fin>>rmq[0][i];
int p=2, nr=0;
while(p<=n)
{
nr++;
for(i=1; i<=n; i++)
rmq[nr][i]=min(rmq[nr-1][i], rmq[nr-1][i+p/2]);
p*=2;
}
while(m--)
{
fin>>x>>y;
int lg=y-x+1;
int pow2=log2(lg);
fout<<min(rmq[pow2][x], rmq[pow2][y-(1<<pow2)+1])<<'\n';
}
return 0;
}