Pagini recente » Cod sursa (job #604396) | Cod sursa (job #791308) | Cod sursa (job #1918237) | Cod sursa (job #2976009) | Cod sursa (job #2574460)
#include <bits/stdc++.h>
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
const int NMAX=100005;
int n,m,v[NMAX],rmq[18][NMAX],lg[NMAX];
int main()
{
in>>n>>m;
for(int i=1;i<=n;i++)
in>>v[i];
for(int i=2;i<=n;i++)
lg[i]=lg[i>>1]+1;
for(int i=1;i<=n;i++)
rmq[0][i]=v[i];
for(int i=1;i<=17;i++)
for(int j=1;j+(1<<(i-1))-1<=n;j++)
rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+(1<<(i-1))]);
for(int i=1,a,b;i<=m;i++){
in>>a>>b;
if(a>b)
swap(a,b);
int l_lg=lg[b-a+1];
out<<min(rmq[l_lg][a],rmq[l_lg][b-(1<<l_lg)+1])<<'\n';
}
return 0;
}