Pagini recente » Monitorul de evaluare | Diferente pentru utilizator/blacknesta intre reviziile 93 si 25 | Istoria paginii utilizator/edi_laitin | Monitorul de evaluare | Cod sursa (job #2197769)
#include <bits/stdc++.h>
using namespace std;
template <typename ForwardIterator, typename Function>
class RMQ{
public:
ForwardIterator first, last;
using T = typename iterator_traits<ForwardIterator>::value_type;
vector<T> V; //value
vector<vector<T> > M; //index of the largest/smallest value
Function func;
vector<int> L; //logs
int n = 0;
RMQ(ForwardIterator a, ForwardIterator b, Function f) : first(a), last(b), func(f) {};
void build(){
while(first!=last){
V.emplace_back(*first);
first++;
n++;
}
M.resize(n+1);
for(int i = 0; i < n; i++)
M[i].emplace_back(i);
L.emplace_back(0);
L.emplace_back(0);
for(int i = 2; i <= n; i++)
L.emplace_back(L[i/2] + 1);
for(int step = 1; step <= L[n]; step++)
for(int i = 0; i < n - (1<<step) + 1; i++)
M[i][step] = func(V[ M[i][step - 1] ], V[ M[i + (1<<(step - 1))][step - 1] ]) ?
M[i][step - 1] : M[i + (1<<(step - 1))][step - 1];
}
int iQuery(int begin, int end){
int step = L[end - begin + 1];
int l = M[begin][step];
int mid = end - (1<<step) + 1;
int r = M[end - (1<<step) + 1][step];
if(func(V[ M[begin][step] ], V[ M[end - (1<<step) + 1][step] ] ))
return M[begin][step];
return M[end - (1<<step) + 1][step];
}
T vQuery(int begin, int end){
return V[iQuery(begin, end)];
}
};
int n, m;
vector<int> V;
shared_ptr<RMQ<vector<int>::iterator, function<bool(int, int)> > > R;
void Read()
{
cin>>n>>m;
int x;
for(int i = 0; i < n; i++) {
cin >> x;
V.emplace_back(x);
}
}
void Solve()
{
int a, b;
R->build();
for(int i = 0; i < m; i++){
cin>>a>>b;
cout<<R->vQuery(a - 1, b - 1)<<"\n";
}
}
int main()
{
ios_base::sync_with_stdio(false);
freopen("rmq.in", "r", stdin);
freopen("rmq.out", "w", stdout);
Read();
R = make_shared<RMQ<vector<int>::iterator, function<bool(int, int)> > >
(V.begin(), V.end(), [](int a, int b) -> bool { return a < b; });
Solve();
return 0;
}