Pagini recente » Atasamentele paginii Profil vagrosu | Monitorul de evaluare | Diferente pentru utilizator/rockoana intre reviziile 2 si 1 | Istoria paginii utilizator/rrobert | Cod sursa (job #2851036)
#include <fstream>
#include <math.h>
using namespace std;
int rmq[100001][18];
ifstream cin("rmq.in");
ofstream cout("rmq.out");
int main()
{
int n,q;
cin>>n>>q;
for(int i=1;i<=n;i++)
{
cin>>rmq[i][0];
}
for(int j=1;(1<<j)<=n;j++)
{
for(int i=1;i<=n;i++)
{
rmq[i][j]=rmq[i][j-1];
if(i+(1<<(j-1))<=n)
{
rmq[i][j]=min(rmq[i][j],rmq[i+(1<<(j-1))][j-1]);
}
}
}
while(q--)
{
int x,y;
cin>>x>>y;
int lg=(int)log2(y-x+1);
cout<<min(rmq[x][lg],rmq[y-(1<<lg)+1][lg])<<'\n';
}
return 0;
}