Pagini recente » Cod sursa (job #3200749) | Diferente pentru implica-te/arhiva-educationala intre reviziile 146 si 223 | Cod sursa (job #2990925) | Cod sursa (job #3284446) | Cod sursa (job #3293742)
#include <fstream>
#include <math.h>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n, m, i, j, x, y, a[100005], rmq[21][100005], p, nr, st, dr, lg;
int main()
{
fin>>n>>m;
for(i=1; i<=n; i++)
fin>>rmq[0][i];
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;
lg=dr-st+1;
p=log2(lg);
fout<<min(rmq[p][st], rmq[p][dr-(1<<p)+1])<<'\n';
}
return 0;
}