Pagini recente » Cod sursa (job #423272) | Cod sursa (job #1846482) | Cod sursa (job #515241) | Cod sursa (job #2552788) | Cod sursa (job #2623338)
#include <bits/stdc++.h>
using namespace std;
int n,m,lg[100005],rmq[20][100005],a,b,i,j,x;
int main()
{
ifstream f("rmq.in");
ofstream g("rmq.out");
f>>n>>m;
for(i=0 ; i<n; i++)
f>>rmq[0][i];
lg[1]=0;
for (i=2;i<=n;i++)
lg[i]=lg[i/2]+1;
for(i = 1 ; (1<<i) <= n ; i++)
for(j = 0 ; j + (1 << i) <= n ; j++)
rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+(1<<(i-1))]);
for(i=0 ; i<m; i++)
{
f>>a>>b;
int log=lg[b-a+1];
x=b-(1<<log);
a--;
g<< min(rmq[log][a],rmq[log][x])<<endl;
}
return 0;
}