Pagini recente » Cod sursa (job #1782051) | Cod sursa (job #1524057) | Cod sursa (job #3207060) | Cod sursa (job #2886145) | Cod sursa (job #3158568)
#include <fstream>
using namespace std;
ifstream cin("rmq.in");
ofstream cout("rmq.out");
int E[100001],m,n,r[20][100001],st,dr,len,var,j;
int main()
{
cin>>n>>m;
for(int i=1; i<=n; i++)
cin>>r[0][i];
E[1]=0;
for(int i=2; i<=n; i++)
E[i]=1+E[i/2];
for(int p=1; (1<<p) <=n; p++)
for(int i=1; i<=n; i++)
{
r[p][i]=r[p-1][i];
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=1; i<=m; i++)
{
cin>>st>>dr;
var=E[dr-st+1];
len=(1<<var);
cout<<min(r[var][st],r[var][dr-len+1])<<"\n";
}
}