Pagini recente » Cod sursa (job #563545) | Cod sursa (job #3277159) | Cod sursa (job #2913140) | Cod sursa (job #848441) | Cod sursa (job #1967970)
#include <bits/stdc++.h>
#define NMAX 100005
#define LGMAX 18
using namespace std;
/// rmq[i][j] = minimul din intervalul ( j , j+2^i-1 )
/// rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+(1<<(i-1))]);
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int rmq[LGMAX][NMAX],loga[NMAX],i,j,n,m,st,dr;
int query (int x,int y)
{
int l=loga[y-x+1];
return min(rmq[l][x],rmq[l][y-(1<<l)+1]);
}
int main()
{
fin>>n>>m;
for(int i=1;i<=n;i++) {
fin>>rmq[0][i];
}
for(int i=2;i<=n;i++) {
loga[i]=loga[i/2]+1;
}
for(int i=1;(1<<i)<=n;i++) {
for(int j=1;j+(1<<i)-1<=n;j++) {
rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+(1<<(i-1))]);
}
}
for(int i=1;i<=m;i++) {
int x,y;
fin>>x>>y;
fout<<query(x,y)<<'\n';
}
return 0;
}