Pagini recente » Cod sursa (job #2703308) | Cod sursa (job #940275) | Cod sursa (job #1975340) | Cod sursa (job #2143954) | Cod sursa (job #2854873)
#include <fstream>
using namespace std;
ifstream cin("rmq.in");
ofstream cout("rmq.out");
const int NMAX=1e5+5,LOGMAX=18;
int v[LOGMAX][NMAX],lg[NMAX];
int main()
{
int n,m;
cin.tie(0);
cin>>n>>m;
lg[1]=0;
for(int i=2;i<NMAX;i++)
{
lg[i]=lg[i>>1]+1;
}
for(int i=1;i<=n;i++)
{
cin>>v[0][i];
}
for(int i=1;(1<<i)<=n;i++)
{
for(int j=1;j<=n-(1<<i)+1;j++)
{
v[i][j]=min(v[i-1][j],v[i-1][j+(1<<(i-1))]);
}
}
for(int i=1;i<=m;i++)
{
int mn,mx,diff,logg;
cin>>mn>>mx;
diff=mx-mn+1;
logg=lg[diff];
cout<<min(v[logg][mn],v[logg][mn+diff-(1<<logg)])<<endl;
}
cout.flush();
return 0;
}