#include "bits/stdc++.h"
#include "jumps.h"
using namespace std;
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define wr puts("----------------")
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int N = 2e5+5;
vector<int> adj[N];
int vis[N];
int n_;
void init(int n, vector<int> v){
n_ = n;
// for(int i = 0; i < n; ++i){
// for(int j = i+1; j < n; ++j)
// if(v[j] > v[i]){
// adj[i].pb(j);
// break;
// }
// for(int j = i-1; j >= 0; --j)
// if(v[j] > v[i]){
// adj[i].pb(j);
// break;
// }
// }
stack<int> s;
for(int i = 0; i < n; ++i){
while(!s.empty() and v[s.top()] <= v[i])
s.pop();
if (!s.empty())
adj[i].pb(s.top());
s.push(i);
}
while (!s.empty())
s.pop();
for(int i = n-1; i >= 0; --i){
while(!s.empty() and v[s.top()] <= v[i])
s.pop();
if (!s.empty())
adj[i].pb(s.top());
s.push(i);
}
}
int minimum_jumps(int a, int b, int c, int d){
for(int i = 0; i <= n_; ++i)
vis[i] = 0;
queue<pii> q;
for(int ad = a; ad <= b; ++ad){
q.push({ad, 0});
vis[ad] = 1;
}
while(!q.empty()){
auto x = q.front();
q.pop();
if(x.ff >= c and x.ff <= d)
return x.ss;
for(auto i : adj[x.ff])
if(!vis[i]){
q.push({i, x.ss+1});
vis[i] = 1;
}
}
return -1;
}
