Pagini recente » Cod sursa (job #23611) | Cod sursa (job #7742) | Cod sursa (job #1501673) | Cod sursa (job #1470669) | Cod sursa (job #3236346)
#include <fstream>
using namespace std;
ifstream cin("rmq.in");
ofstream cout("rmq.out");
int N = 100000];
int R[17][N+1], E[N+1];
int main()
{
int n , m;
cin>>n>>m;
for(int i = 1;i<=n;i++)
cin>>R[0][i];
for(int p = 1; (1<<p) <= n ; p++)
{
for(int i = 1;i<=n;i++)
{
R[p][i] = R[p-1][i];
int j = i + (1<<(p-1));
if(j<=n&&R[p][i]>R[p-1][j])
R[p][i] = R[p-1][j];
}
}
for(int i = 2;i<=n;i++)
E[i] = E[i/2]+1;
for(int i = 1;i<=m;i++)
{
int st , dr;
cin>>st>>dr;
int e = E[dr-st+1];
int len = (1<<e);
cout<<min(R[e][st],R[e][dr-len+1])<<'\n';
}
return 0;
}