#include <bits/stdc++.h>
using namespace std;
int n;
vector<int> h;
const int INF = 1e9;
struct node {
int left = -1;
int right = -1;
};
vector<node> nodes;
vector< vector<int> > binary_lifting(262144 + 1, vector<int>(32, -1)); // It tells you the 2^j ancestor of i.
void init(int N, vector<int> H) {
n = N;
h = H;
nodes = vector<node>(n); // It's a graph, has the index to the children.
for (int i = 1; i < n; i++) {
int target = i - 1;
while (H[target] <= H[i]) {
if (target == -1) {
break;
}
target = nodes[target].left;
}
nodes[i].left = target;
}
for (int i = n - 2; i >= 0; i--) {
int target = i + 1;
while (H[target] <= H[i]) {
if (target == -1) {
break;
}
target = nodes[target].right;
}
nodes[i].right = target;
}
// Create the binary_lift
// Create the base ancestors;
for (int i = 0; i < n; i++) {
int greatest = -1;
int ancestor = -1;
if (nodes[i].left != -1 && greatest < H[nodes[i].left]) {
greatest = H[nodes[i].left];
ancestor = nodes[i].left;
}
if (nodes[i].right != -1 && greatest < H[nodes[i].right]) {
greatest = H[nodes[i].right];
ancestor = nodes[i].right;
}
binary_lifting[i][0] = ancestor;
}
for (int i = 1; i < 32; i++) {
for (int j = 0; j < n; j++) {
if (binary_lifting[j][i - 1] == -1) {
binary_lifting[j][i] = -1;
}
else {
binary_lifting[j][i] = binary_lifting[binary_lifting[j][i - 1]][i - 1];
}
}
}
return;
}
int next_jump(int a, int c) {
if (a == -1) {
return -1;
}
int greatest = -1;
int ancestor = -1;
if (nodes[a].left != -1 && greatest < h[nodes[a].left] && h[nodes[a].left] <= h[c]) {
greatest = h[nodes[a].left];
ancestor = nodes[a].left;
}
if (nodes[a].right != -1 && greatest < h[nodes[a].right] && h[nodes[a].right] <= h[c]) {
greatest = h[nodes[a].right];
ancestor = nodes[a].right;
}
return ancestor;
}
int find_ancestor(int source, int distance) {
int pos = source;
for (int i = 31; i >= 0; i--) {
if (distance & (1<<i)) {
pos = binary_lifting[pos][i];
if (pos == -1) {
return -1;
}
}
}
return pos;
}
int minimum_jumps(int A, int B, int C, int D) {
// Start the BFS
vector<int> dist(n + 10, INF);
queue<int> q;
for (int i = A; i <= B; i++) {
dist[i] = 0;
q.push(i);
}
while (!q.empty()) {
int source = q.front(); q.pop();
if (next_jump(source, C) != -1) {
q.push(next_jump(source, C));
dist[next_jump(source, C)] = 1 + dist[source];
}
}
int smallest = INF;
for (int i = C; i <= D; i++) {
smallest = min(smallest, dist[i]);
}
if (next_jump(find_ancestor(A, smallest - 1), C) != C) {
return INF;
}
if (smallest == INF) {
return -1;
}
return smallest;
}
