//Never stop trying
#ifndef LOCAL
#pragma GCC optimize ("Ofast")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#endif
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
typedef long long ll;
typedef string str;
typedef double db;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
typedef vector<str> vs;
typedef vector<ld> vd;
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
const int MOD = 1e9 + 7; //998244353
const ll INF = 2e9;
const int MX = 1e5 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up
template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
//constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
//mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
ll random(ll a, ll b){
return a + rng() % (b - a + 1);
}
#ifndef LOCAL
#define cerr if(false) cerr
#endif
#define dbg(x) cerr << #x << " : " << x << endl;
#define dbgs(x,y) cerr << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << #v << " : " << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;
#define here() cerr << "here" << endl;
void IO() {
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
#ifndef LOCAL
#include "elephants.h"
#endif
int N,L;
vi X(MX),vec;
bool cmp(int i, int j){
return X[i] < X[j];
}
void init(int n, int l, int XX[]){
N=n; L=l; FOR(i,0,N) X[i+1]=XX[i];
N+=2; X[0]=-INF,X[N-1]=INF;
FOR(i,0,N) vec.pb(i);
sort(all(vec),cmp);
}
int update(int p, int y){
p++;
X[p]=y;
int idx;
FOR(i,0,N) if(vec[i]==p){
idx=i; break;
}
if(!(X[p]>X[vec[idx-1]] && X[p]<X[vec[idx+1]])){
vec.erase(vec.begin()+idx);
int idx2;
FOR(i,0,N-1){
if(X[p]>X[vec[i]] && X[p]<X[vec[i+1]]){
idx2=i+1; break;
}
}
vec.insert(vec.begin()+idx2,p);
}
dbgv(vec)
int j=1,ans=1;
FOR(i,1,N-1){
if(X[vec[i]]-X[vec[j]]>L){
j=i; ans++;
}
}
return ans;
}
#ifdef LOCAL
int main() {
boost; IO();
int N,L; cin>>N>>L;
int X[N]; FOR(i,0,N) cin>>X[i];
init(N,L,X);
//cout << update(2,16) << endl;
cout << update(1,25) << endl;
/*cout << update(3,35) << endl;
cout << update(0,38) << endl;
cout << update(2,0) << endl;*/
return 0;
}
#endif
/*
4 10
10 15 17 20
*/
/* Careful!!!
.Array bounds
.Infinite loops
.Uninitialized variables / empty containers
.Multisets are shit
Some insights:
.Binary search
.Graph representation
.Write brute force code
.Change your approach
*/
