#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int n;
vector<int> h;
vector<int> toL, toR;
vector<vector<int>> g, revG;
vector<int> deg;
void init(int N, vector<int> H) {
n = N;
h = {0};
toL.assign(n+1, 0);
toR.assign(n+1, 0);
for (auto x: H) h.push_back(x);
int currM = 0;
for (int i = 1; i <= n; i++) {
toL[i] = currM;
if (h[i] >= h[currM]) currM = i;
}
currM = n+1;
for (int i = n-1; i >= 1; i--) {
toR[i] = currM;
if (currM == n + 1 || h[i] >= h[currM]) currM = i;
}
deg.assign(n+1, 0);
revG.resize(n+1);
g.resize(n+1);
for (int i = 1; i <= n; i++) {
if (toL[i] >= 1) {
g[i].push_back(toL[i]);
revG[toL[i]].push_back(i);
deg[i]++;
}
if (toR[i] <= n) {
g[i].push_back(toR[i]);
revG[toR[i]].push_back(i);
deg[i]++;
}
}
}
int minimum_jumps(int a, int b, int c, int d) {
queue<int> q;
vector<int> currDeg = deg;
for (int i = 1; i <= n; i++) {
if (currDeg[i] == 0) q.push(i);
}
vector<int> dp(n+1, INF);
while (!q.empty()) {
int curr = q.front();
q.pop();
if (curr >= c && curr <= d) dp[curr] = 0;
for (auto next: g[curr]) {
dp[curr] = min(dp[curr], 1 + dp[next]);
}
for (auto next: revG[curr]) {
currDeg[next]--;
if (currDeg[next] == 0) q.push(next);
}
}
int mn = INF;
for (int i = a; i <= b; i++) {
mn = min(mn, dp[i]);
}
if (mn == INF) return -1;
else return mn;
}
