Pagini recente » Cod sursa (job #372618) | Cod sursa (job #851672) | Cod sursa (job #1401121) | Cod sursa (job #2270116) | Cod sursa (job #2625878)
#include <iostream>
#include <fstream>
using namespace std;
int lg[100002], rmq[20][100002], v[100002];
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);
cout<<min(rmq[l][a],rmq[l][a+s])<<'\n';
}
return 0;
}