Pagini recente » Cod sursa (job #3160106) | Cod sursa (job #522762) | Cod sursa (job #832586) | Cod sursa (job #1974330) | Cod sursa (job #2447767)
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
ll n, rmq[18][100001], q, lg[100001], l, v[100001];
int main()
{
f>>n>>q;
for(int i=1; i<=n; i++)
f>>v[i];
lg[1]=0;
for(int i=2; i<=n; i++)
lg[i]=lg[i/2]+1;
for(int i=1; i<=n; i++)
rmq[0][i]=v[i];
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]);
ll x, y, d, a;
for(int i=1; i<=q; i++)
{
f>>x>>y;
d=y-x+1;
l=lg[d];
a=d-(1<<l);
g<<min(rmq[l][x], rmq[l][x+a])<<'\n';
}
return 0;
}