Pagini recente » Cod sursa (job #813678) | Cod sursa (job #1514160) | Cod sursa (job #1098116) | Cod sursa (job #1092464) | Cod sursa (job #1867102)
#include <fstream>
using namespace std;
ifstream cin ("rmq.in");
ofstream cout ("rmq.out");
int sol[20][100010],n,m,k;
void read ()
{
cin>>n>>k;
for(int i=1;i<=n;i++) cin>>sol[0][i];
int r=1;
while(r<=n) r*=2,m++; m--;
}
void construct ()
{
for(int i=1;i<=m;i++)
for(int j=1;j<=n;j++)
{
int y=1<<i; y/=2; y=y+j; sol[i][j]=sol[i-1][j];
if(sol[i-1][y]<sol[i][j] && y<=n) sol[i][j]=sol[i-1][y];
}
}
void answare ()
{
for(int i=1;i<=k;i++)
{ int a,b;
cin>>a>>b;
if(a>b) swap(a,b);
int l=b-a+1;
int r=1,mm=0;
while(r<=l) r*=2,mm++; --mm; r/=2;
cout<<min(sol[mm][a],sol[mm][b-r+1])<<"\n";
}
}
int main()
{
read();
construct();
answare();
cin.close();
cout.close();
return 0;
}