#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "elephants.h"
int n;
int l;
VI a;
VI b;
void init(int N, int L, int X[]) {
n = N;
l = L;
a = VI(n);
rep(i, n) a[i] = X[i];
b = a;
sort(all(b));
}
stack<int> st;
void replace(VI& b, int x, int y) {
while (b.back() > x) {
st.push(b.back());
b.pop_back();
}
b.pop_back();
while (b.size() && b.back() > y) {
st.push(b.back());
b.pop_back();
}
while (st.size() && st.top() < y) {
b.pb(st.top());
st.pop();
}
b.pb(y);
while (st.size()) {
b.pb(st.top());
st.pop();
}
}
int update(int i, int y) {
replace(b, a[i], y);
a[i] = y;
int R = -1e9;
int ans = 0;
for (int x : b) {
if (x > R) ans++, R = x+l;
}
return ans;
}
