Pagini recente » Cod sursa (job #2918532) | Cod sursa (job #585522) | Cod sursa (job #2962881) | Cod sursa (job #379644) | Cod sursa (job #2623352)
#include <bits/stdc++.h>
#define N 100002
using namespace std;
int lg[N],rmq[20][N],a,b;
int main()
{
ifstream f("rmq.in");
ofstream g("rmq.out");
int n,m,i,j,x,l;
f>>n>>m;
for(i=1 ; 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 = 1 ; j + (1 << i) - 1 <= 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;
l=lg[b-a+1];
g<< min(rmq[l][a],rmq[l][b+1-(1<<l)])<<endl;
}
return 0;
}