#include <cstdio>
#include <cstdlib>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <limits.h>
#include <set>
#include <string>
#include <queue>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <deque>
#include <map>
#include <chrono>
#include <random>
#include <bitset>
#include <tuple>
#include <cassert>
#include "jumps.h"
#define SZ(x) (LL)(x.size())
#define FR(i,a,b) for(LL i=(a);i<(b);++i)
#define FOR(i,n) FR(i,0,n)
#define FAST ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define A first
#define B second
#define mp(a,b) make_pair(a,b)
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
typedef unsigned __int128 U128;
typedef __int128 I128;
typedef std::pair<int,int> PII;
typedef std::pair<LL,LL> PLL;
typedef std::pair<LD,LD> PLD;
using namespace std;
const int MAXN=2e5+5;
vector<int> adj[MAXN];
int h[MAXN], l[MAXN], r[MAXN];
bool vis[MAXN];
int n;
int bfs(int a, int b, int c, int d){
queue<PII> q;
FOR(i,n) vis[i]=false;
FR(i,a,b+1){
q.push(mp(0,i));
vis[i]=true;
}
while (!q.empty()){
PII cur=q.front();
int dist=cur.A, u=cur.B;
q.pop();
if (c<=u && u<=d) return dist;
for (int v:adj[u]){
if (!vis[v]){
vis[v]=true;
q.push(mp(dist+1,v));
}
}
}
return -1;
}
void init(int N, std::vector<int> H) {
n=N;
FOR(i,n) h[i]=H[i];
deque<int> dq;
FOR(i,n){
while (!dq.empty () && h[dq.back()]<h[i]) dq.pop_back();
if (dq.empty()) l[i]=-1;
else l[i]=dq.back();
dq.push_back(i);
}
dq.clear();
for(int i=n-1;i>=0;i--){
while (!dq.empty () && h[dq.back()]<h[i]) dq.pop_back();
if (dq.empty()) r[i]=-1;
else r[i]=dq.back();
dq.push_back(i);
}
FOR(i,n){
if (l[i]!=-1) adj[i].push_back(l[i]);
if (r[i]!=-1) adj[i].push_back(r[i]);
}
}
int minimum_jumps(int a, int b, int c, int d) {
return bfs(a,b,c,d);
}
