#include <bits/stdc++.h>
using namespace std;
const int MAX = 2e5 + 5;
int n, h[MAX], l[MAX], r[MAX];
void init(int N, vector <int> H){
n = N;
for (int i = 0; i < n; ++ i)
h[i + 1] = H[i];
r[0] = n + 1;
vector <int> stk;
for (int i = 1; i <= n; ++ i){
while (stk.size() && h[i] > h[stk.back()])
stk.pop_back();
l[i] = stk.size() ? stk.back() : 0;
stk.push_back(i);
}
stk.clear();
for (int i = n; i >= 1; -- i){
while (stk.size() && h[i] > h[stk.back()])
stk.pop_back();
r[i] = stk.size() ? stk.back() : n + 1;
stk.push_back(i);
}
}
int minimum_jumps(int a, int b, int c, int d){
a ++, b ++, c ++, d ++;
int st = 0;
for (int i = a; i <= b; ++ i) if (r[a] <= d) {
if (!st || h[i] > h[st])
st = i;
}
int ans = 0;
while (st < c && r[st] <= d){
int i = l[st], j = r[st];
if (h[i] < h[j]) swap(i, j);
ans ++;
if (r[i] <= d) st = i;
else st = j;
}
if (st >= c) return ans;
return -1;
}
