Pagini recente » Cod sursa (job #1317973) | Cod sursa (job #2516205) | Cod sursa (job #2549674) | Cod sursa (job #748019) | Cod sursa (job #3001725)
#include <bits/stdc++.h>
#define N 100005
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n,m,rmq[N][20];
int main()
{
int i,j,lg,x,y,op,a[N];
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<=log2(n);j++)
for(i=1;i+(1<<j)-1<=n;i++)
rmq[i][j]=min(rmq[i][j-1],rmq[i+1<<(j-1)][j-1]);
while(m--)
{
fin>>x>>y;
lg=log2(y-x+1);
fout<<min(rmq[x][lg],rmq[y-(1<<lg)+1][lg])<<"\n";
}
return 0;
}