#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5;
int h[MAXN], prevmx[MAXN];
int n;
void init(int N, vector<int> H) {
n = N;
memset(prevmx, -1, sizeof prevmx);
copy(H.begin(), H.end(), h);
set<int> cur;
int l = 0;
for (int i = 0; i < n; ++i) {
prevmx[i] = i - 1;
while (prevmx[i] != -1 && h[prevmx[i]] <= h[i]) {
prevmx[i] = prevmx[prevmx[i]];
}
}
}
int minimum_jumps(int A, int B, int C, int D) {
int mncnt = n;
for (int i = B; i >= A; --i) {
for (int j = C; j <= D; ++j) {
if (prevmx[j] < i) {
int cnt = 0;
int curmx = h[i];
for (int k = i + 1; k <= j; ++k) {
if (curmx < h[k]) {
curmx = h[k];
cnt++;
}
}
mncnt = min(mncnt, cnt);
}
}
}
return mncnt == n ? -1 : mncnt;
}
int main() {
init(7, {3, 2, 1, 6, 4, 5, 7});
cout << minimum_jumps(4, 4, 6, 6) << '\n';
cout << minimum_jumps(1, 3, 5, 6) << '\n';
cout << minimum_jumps(0, 1, 2, 2) << '\n';
return 0;
}
