Pagini recente » Cod sursa (job #1242311) | Cod sursa (job #2046980) | Cod sursa (job #2389218) | Cod sursa (job #867837) | Cod sursa (job #1655963)
#include <iostream>
#include <vector>
#include <algorithm>
#include <limits>
#include <numeric>
#include <cstring>
#include <string>
#include <queue>
#include <set>
#include <cmath>
#include <fstream>
#include <cstdlib>
#include <map>
#define pb push_back
#define mp make_pair
#define INF numeric_limits<int>::max()
#define bit(x) (-x)&x
#define int64 long long
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
int RMQ[18][1<<18],n,q,lg[1<<18];
int main()
{
in>>n>>q;
for(int i=1;i<=n;i++)
in>>RMQ[0][i];
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]);
for(;q;q--)
{
int x,y;
in>>x>>y;
int diff=y-x+1;
out<<min(RMQ[ lg[diff] ][ x ],RMQ[ lg[diff] ][ x + diff - (1<<lg[diff]) ])<<'\n';
}
return 0;
}