Pagini recente » Cod sursa (job #2779315) | Cod sursa (job #2522122) | Cod sursa (job #2466072) | Cod sursa (job #2530403) | Cod sursa (job #2623361)
#include <bits/stdc++.h>
#define N 100002
using namespace std;
int lg[N],rmq[20][N],v[N];
int main()
{
ifstream f("rmq.in");
ofstream g("rmq.out");
int n,m;
f>>n>>m;
for(int i = 1; i <= n; i++)
f >> v[i];
for(int i = 1; i <= n; i++)
rmq[0][i] = v[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 + (1 << i) - 1 <= n ; j++)
rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+(1<<(i-1))]);
for(int i=0 ; i<m; i++)
{
int a,b;
f>>a>>b;
int dif=b-a+1;
int l=lg[dif];
int s=dif-(1<<l);
g<< min(rmq[l][a],rmq[l][a+s])<<'\n';
}
return 0;
}