Pagini recente » Cod sursa (job #2510467) | Cod sursa (job #3252313) | Cod sursa (job #101435) | Cod sursa (job #2528235) | Cod sursa (job #1953370)
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
#define logn 17
#define nmax 100005
int a[nmax], n, m, rmq[nmax][logn];
int main()
{
int i, j, x, y, sol;
fin>>n>>m;
for(i=1; i<=n; i++)
fin>>a[i];
for(i=1; i<=n; i++)
rmq[i][0]=a[i];
for(j=1; j<=logn; j++)
for(i=1; i+(1<<j)<=n; i++)
rmq[i][j]=min(rmq[i][j-1], rmq[i+(1<<(j-1))][j-1]);
while(m)
{
m--;
fin>>x>>y;
sol=nmax;
for(j=logn; j>=0; j--)
if(x+(1<<j)-1<=y)
{
sol=min(sol, rmq[x][j]);
x=x+(1<<j);
}
fout<<sol<<'\n';
}
return 0;
}