#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i) 
#define R(i, j, k) for(int i = (j); i >= (k); --i) 
#define ll long long 
#define vi vector < int > 
#define sz(a) ((int) (a).size())
#define me(a, x) memset(a, x, sizeof(a))
using namespace std;
const int N = 1e6 + 7;
int n, a[N];
void init(int xn, vi A) {
	n = xn;
	L(i, 1, n) a[i] = A[i - 1];
}

int d, ch[N][2], mn[N];
void dfs(int x) {
	mn[x] = a[x];
	L(a, 0, 1) if(ch[x][a]) dfs(ch[x][a]), mn[x] = min(mn[x], mn[ch[x][a]]);
}

int slv(int x, int lim) {
	if(!x) return 0;
	if(mn[x] > lim) return 0;
	if(mn[x] > a[x] - d) return 1;
	else return slv(ch[x][0], a[x] - d) + slv(ch[x][1], a[x] - d);
}

int stk[N], top;
int max_towers(int l, int r, int D) {
	++l, ++r, d = D, top = 0;
	L(i, 1, n) stk[i] = ch[i][0] = ch[i][1] = 0;
	L(i, l, r) {
		int las = top;
		while(top && a[stk[top]] < a[i]) -- top;
		if(top > 0) ch[stk[top]][1] = i;
		if(top != las) ch[i][0] = stk[top + 1];
		stk[++top] = i;
	}
	dfs(stk[1]);
	return slv(stk[1], 1e9 + 7);
}
//
//int main() {
//	init(7, vi{10, 20, 60, 40, 50, 30, 70});
//	cout << max_towers(1, 5, 10) << '\n';
//	cout << max_towers(2, 2, 100) << '\n';
//	cout << max_towers(0, 6, 17) << '\n';
//	return 0;
//}