Pagini recente » Cod sursa (job #337489) | Cod sursa (job #758749) | Cod sursa (job #238546) | Cod sursa (job #577633) | Cod sursa (job #3244151)
#include <fstream>
using namespace std;
ifstream cin("rmq.in");
ofstream cout("rmq.out");
int rmq[17][100005], n, m;
inline int lg(int x)
{
return 31-__builtin_clz(x);
}
void build_rmq()
{
for(int i=1;i<=16;i++)
for(int j=1;j<=n-(1<<i)+1;j++)
rmq[i][j]=min(rmq[i-1][j], rmq[i-1][j+(1<<(i-1))]);
}
int query(int x, int y)
{
int p=lg(y-x+1);
return min(rmq[p][x], rmq[p][y-(1<<p)+1]);
}
int main()
{
cin>>n>>m;
for(int i=1;i<=n;i++)
cin>>rmq[0][i];
build_rmq();
for(int i=1;i<=m;i++)
{
int x, y;
cin>>x>>y;
cout<<query(x, y)<<'\n';
}
return 0;
}