Pagini recente » Cod sursa (job #1762552) | preONI 2005 runda #1 - solutii | Cod sursa (job #2021536) | Cod sursa (job #1122495) | Cod sursa (job #2574667)
#include<bits/stdc++.h>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n, q, rmq[25][200001], lg[200201], nr, v[200001];
int main()
{
f>>n>>q;
for(int i=1; i<=n; i++)
f>>v[i];
for(int i=1; i<=n; i++)
rmq[0][i]=v[i];
for(int i=2; i<=200000; i++)
lg[i]=lg[i/2]+1;
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;
nr=lg[b-a+1];
g<<min(rmq[nr][a], rmq[nr][b-(1<<nr)+1])<<'\n';
}
return 0;
}