Pagini recente » Cod sursa (job #2079319) | Cod sursa (job #1331123) | Cod sursa (job #461479) | Cod sursa (job #1397969) | Cod sursa (job #1955749)
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int rmq[100002][18];
int n,m;
int main()
{
fin>>n>>m;
for(int i=1;i<=n;i++)
fin>>rmq[0][i];
for(int i=1;(1 << i) <= n; i++)
for(int j=1; j <= n - (1 << i)+1; j++)
{
int l = 1 << (i-1);
rmq[i][j] = min(rmq[i-1][j], rmq[i-1][j+l]);
}
int x,y;
for(int i=1;i<=m;i++)
{
fin>>x>>y;
int diff = y-x+1;
int l = log2(diff);
int sh = diff - (1<<l);
fout<<min(rmq[l][x],rmq[l][x+sh])<<"\n";
}
return 0;
}