Pagini recente » Istoria paginii runda/11 | Cod sursa (job #1092259) | Cod sursa (job #3138977) | Rating Coman Catalin (catalin1200) | Cod sursa (job #2464549)
#include <bits/stdc++.h>
#define cin fin
#define cout fout
#define LMAX 20
#define NMAX 100005
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n, m;
int x, y;
int lg[NMAX];
int v[NMAX];
int rmq[LMAX][NMAX];
void read();
void build();
int main()
{
read();
return 0;
}
void read()
{
cin>>n>>m;
for(int i=1; i<=n; ++i)
cin>>v[i];
build();
for(int i=1; i<=m; ++i)
{
cin>>x>>y;
int dif=y-x+1;
int nr=lg[dif];
int limita=dif-(1<<nr);
cout<<min(rmq[nr][x], rmq[nr][x+limita])<<'\n';
}
}
void build()
{
lg[1]=0;
for(int i=2; i<=n; ++i)
lg[i]=lg[i/2]+1;
for(int i=1; i<=n; ++i)
rmq[0][i]=v[i];
for(int i=1; (1<<i)<=n; ++i)
for(int j=1; (1<<i)+j-1<=n; ++j)
rmq[i][j]=min(rmq[i-1][j], rmq[i-1][j+(1<<(i-1))]);
}