Pagini recente » Cod sursa (job #831443) | Cod sursa (job #1012246) | Cod sursa (job #2361497) | Profil florinhaja | Cod sursa (job #1998928)
#include <bits/stdc++.h>
#define NMax 100005
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int N,M;
int x[NMax];
int lg[NMax],RMQ[20][NMax];
int main()
{
fin>>N>>M;
for(int i=1;i<=N;i++)
fin>>x[i], RMQ[0][i]=x[i];
lg[1]=0;
for(int i=2;i<=N;i++)
lg[i]=lg[i/2]+1;
for(int i=1;(1<<i)<=N;i++)
for(int j=1;j<=N-(1<<i)+1;j++)
RMQ[i][j]=min(RMQ[i-1][j],RMQ[i-1][j+(1<<(i-1))]);
for(int i=1;i<=M;i++)
{
int x,y;
fin>>x>>y;
int log=lg[y-x+1];
int sh=y-x+1-(1<<log);
fout<<min(RMQ[log][x],RMQ[log][x+sh])<<"\n";
}
return 0;
}