Pagini recente » Cod sursa (job #2050646) | Cod sursa (job #13858) | Cod sursa (job #73618) | Cod sursa (job #1158932) | Cod sursa (job #3291371)
#include <fstream>
#include <math.h>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n, m, a[100005], rmq[32][100005], p, nr, i, x, y, lg, pow2;
int main()
{
fin>>n>>m;
for(i=1; i<=n; i++)
fin>>rmq[0][i];
p=2;
while(p<=n)
{
nr++;
for(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>>x>>y;
lg=y-x+1;
p=log2(lg);
pow2=1<<p;
fout<<min(rmq[p][x], rmq[p][y-pow2+1])<<'\n';
}
return 0;
}