Pagini recente » Cod sursa (job #3344049) | Cod sursa (job #1559947) | Cod sursa (job #1106532) | Cod sursa (job #2828008) | Cod sursa (job #3343789)
#include <bits/stdc++.h>
#define nmax 100005
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int rmq[25][nmax],n,m,E[nmax];
int main()
{
fin>>n>>m;
for(int i=1; i<=n; i++)
fin>>rmq[0][i];
for(int p=1; (1<<p)<=n; p++)
{
for(int i=1; i<=n; i++)
{
rmq[p][i]=rmq[p-1][i];
int j=i+(1<<(p-1));
if(j<=n and rmq[p-1][j]<rmq[p][i])
rmq[p][i]=rmq[p-1][j];
}
}
E[1]=0;
for(int i=2; i<=n; i++)
E[i]=1+E[i/2];
for(int i=1; i<=m; i++)
{
int st,dr;
fin>>st>>dr;
int e=E[dr-st+1];
int len=(1<<e);
fout<<min(rmq[e][st],rmq[e][dr-len+1])<<'\n';
}
return 0;
}