Pagini recente » Cod sursa (job #2870709) | Cod sursa (job #450815) | Cod sursa (job #3186694) | Cod sursa (job #2132982) | Cod sursa (job #2734311)
#include<bits/stdc++.h>
#define fi first
#define sc second
#define ll long long
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n, q, rmq[25][200001], lg[400001];
int main()
{
f>>n>>q;
for(int i=2; i<=n; i++)
lg[i]=lg[i/2]+1;
for(int i=1; i<=n; i++)
{
int x;
f>>x;
rmq[0][i]=x;
}
for(int i=1; i<=lg[n]; i++)
for(int j=1; j<=n; j++)
rmq[i][j]=min(rmq[i-1][j], rmq[i-1][j+(1<<(i-1))]);
for(; q; q--)
{
int a, b;
f>>a>>b;
int nr=lg[b-a+1];
g<<min(rmq[nr][a], rmq[nr][b-(1<<nr)+1])<<'\n';
}
return 0;
}