Pagini recente » Cod sursa (job #3252464) | Cod sursa (job #2933072) | Cod sursa (job #961538) | Cod sursa (job #642707) | Cod sursa (job #2528041)
#include<bits/stdc++.h>
using namespace std;
int n,rmq[200][18],m;
int main()
{
ifstream f("rmq.in");
ofstream g("rmq.out");
f>>n>>m;
for(int i=1;i<=n;i++)
f>>rmq[i][0];
for(int j=1;j<=18;j++){
for (int i=1;i<=n+1-(1<<i);++i)
{
rmq[i][j]=min(rmq[i][j-1],rmq[i+(1<<(j-1))][j-1]);
}
}
while (m--)
{
int a,b;
cin>>a>>b;
int lg=log2(b-a+1);
cout<<min(rmq[a][lg],rmq[b-(1<<lg)+1][lg])<<"\n";
}
return 0;
}