#include "jumps.h"
#include <iostream>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <cstring>
#include <vector>
#include <string>
#include <climits>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <bitset>
#include <cassert>
#include <list>
using namespace std;
typedef long long ll;
ll n;
struct segtree{
vector<ll> tree;
segtree(): tree(808080){}
void init(ll node, ll s, ll e, vector<ll> &v){
if(s==e)tree[node] = v[s];
else{
ll mid = s+e>>1;
init(node<<1,s,mid,v); init(node<<1|1,mid+1,e,v);
tree[node] = max(tree[node<<1],tree[node<<1|1]);
}
}
ll query(ll node, ll s, ll e, ll l, ll r){
if(l>r)return -1;
if(e<l or r<s)return 0;
if(l<=s and e<=r)return tree[node];
ll mid = s+e>>1;
return max(query(node<<1,s,mid,l,r), query(node<<1|1,mid+1,e,l,r));
}
ll Q(ll l, ll r){ return query(1,1,n,l,r); }
} seg;
vector<ll> v;
ll L[202020][22];
ll R[202020][22];
void init(int N, std::vector<int> H) {
n=N;
v.push_back(0);
for(int i = 1 ; i <= n ; i++)v.push_back(H[i-1]);
seg.init(1,1,n,v);
stack<ll> st;
for(int i = n ; i >= 1 ; i--){
while(st.size() and v[st.top()] < v[i]){
L[st.top()][0] = i;
st.pop();
}
st.push(i);
}
while(st.size())st.pop();
for(int i = 1 ; i <= n ; i++){
while(st.size() and v[st.top()] < v[i]){
R[st.top()][0] = i;
st.pop();
}
st.push(i);
}
for(int j = 1 ; j <= 20 ; j++){
for(int i = 1 ; i <= n ; i++){
L[i][j] = L[L[i][j-1]][j-1];
R[i][j] = R[R[i][j-1]][j-1];
}
}
}
ll AB, BC, CD;
ll c;
pair<ll,ll> move_R(ll x){ //몇번 이동해야 좌표가 C 이상인가?
ll ret = 0;
for(int i = 20 ; i >= 0 ; i--){
if(R[x][i]<=0)continue;
if(R[x][i] < c)ret += (1<<i), x = R[x][i];
}
return {ret+1,R[x][0]};
}
int minimum_jumps(int A, int B, int C, int D) {
A++; B++; C++; D++;
c=C;
AB = seg.Q(A,B), BC = seg.Q(B+1,C-1), CD = seg.Q(C,D);
ll ret = 1e9;
if(v[B] < BC){ //BC 미만인 가장 큰놈부터
ll cur = B;
for(int i = 20 ; i >= 0 ; i--){
if(L[cur][i]<=0)continue;
if(L[cur][i]>=A and v[L[cur][i]] < BC)cur = L[cur][i];
}
auto [res,e] = move_R(cur);
if(e>=C and e<=D){
ret = min(ret, res);
}
}
if(AB>BC){ //BC 초과인 가장 작은놈부터
ll cur = B;
for(int i = 20 ; i >= 0 ; i--){
if(L[cur][i]<=0)continue;
if(v[L[cur][i]] < BC)cur = L[cur][i];
}
if(v[cur]<BC)cur = L[cur][0];
assert(cur>=A);
auto [res,e] = move_R(cur);
if(e>=C and e<=D){
ret = min(ret, res);
}
}
if(AB<BC){ //제일 큰놈
if(seg.Q(1,B) > BC){
ll cur = B;
for(int i = 20 ; i >= 0 ; i--){
if(L[cur][i]<=0)continue;
if(L[cur][i]>=A)cur = L[cur][i];
}
ll res = 0;
for(int i = 20 ; i >= 0 ; i--){
if(L[cur][i]<=0)continue;
if(v[L[cur][i]] <= BC)res += (1<<i), cur = L[cur][i];
}
res++;
cur = L[cur][0];
auto [res2,e] = move_R(cur);
if(e>=C and e<=D){
ret = min(ret, res+res2);
}
}
ll cur = B;
for(int i = 20 ; i >= 0 ; i--){
if(L[cur][i]<=0)continue;
if(L[cur][i]>=A)cur = L[cur][i];
}
ll tmp = cur;
for(int i = 20 ; i >= 0 ; i--){
if(L[tmp][i]<=0)continue;
if(v[L[tmp][i]] <= BC)tmp = L[tmp][i];
}
if(tmp!=cur){
ll res = 0;
for(int i = 20 ; i >= 0 ; i--){
if(L[cur][i]<=0)continue;
if(v[R[L[cur][i]][0]] != v[R[tmp][0]])res += (1<<i), cur = L[cur][i];
}
res++; cur = L[cur][0];
auto [res2,e] = move_R(cur);
if(e>=C and e<=D){
ret = min(ret, res+res2);
}
}
}
if(ret==1e9)ret = -1;
return ret;
}
/*
10 100
8 7 2 1 3 4 5 6 9 10
3 3 9 9
ans : 4
*/
