Pagini recente » Cod sursa (job #1528061) | Cod sursa (job #1230369) | Cod sursa (job #2354969) | Cod sursa (job #2486725) | Cod sursa (job #2754370)
#include <bits/stdc++.h>
using namespace std;
#define Max 100001
const int K = log(Max);
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int V[Max],P2[Max];
int RMQ[K][Max];
int main()
{
int n,m;
fin>>n>>m;
for (int i=1;i<=n;i++)
{
fin>>V[i];
RMQ[0][i] = V[i];
}
P2[1] = 0;
for (int i=2;i<n;i++)
P2[i] = P2[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))]);
int x,y,l;
for (int i=0;i<m;i++)
{
fin>>x>>y;
l = P2[y-x+1];
fout<<min(RMQ[l][x],RMQ[l][x+(y-x+1)-(1<<l)])<<"\n";
}
fin.close();
fout.close();
return 0;
}