#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << "\n"
#define COUTF(x) cout << setprecision(15) << (x) << "\n"
#define ENDL cout << "\n"
#define DF(x) x.erase(x.begin())
#define ALL(x) x.begin(), x.end()
#define SORT(x) sort(ALL(x))
#define RSORT(x) sort(x.rbegin(), x.rend())
#define REVERSE(x) reverse(ALL(x))
#define MAX(x) *max_element(ALL(x))
#define MAXI(x) max_element(ALL(x)) - x.begin()
#define SUM(x) accumulate(ALL(x), 0ll)
#define COUNT(x, y) count(ALL(x), y);
#define ANS cout << ans << "\n"
#define YES cout << "YES\n";
#define NO cout << "NO\n";
#define Yes cout << "Yes\n";
#define No cout << "No\n";
#define YN YES else NO
#define yn Yes else No
#define init() \
  cin.tie(0);  \
  ios::sync_with_stdio(false)
#define LINE cerr << "[debug] line: " << __LINE__ << "\n";
#define debug(x) cerr << "[debug] " << #x << ": " << x << "\n";
#define debugV(v)                       \
  cerr << "[debugV] " << #v << ":";     \
  rep(z, v.size()) cerr << " " << v[z]; \
  cerr << "\n";
using namespace std;
using ll = long long;
using ld = long double;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using mll = map<ll, ll>;
using qll = queue<ll>;
using P = pair<ll, ll>;
using vp = vector<P>;
using vs = vector<string>;

template <typename T>
inline istream& operator>>(istream& i, vector<T>& v) {
  rep(j, v.size()) i >> v[j];
  return i;
}

template <typename T1, typename T2>
inline istream& operator>>(istream& i, pair<T1, T2>& v) {
  return i >> v.first >> v.second;
}

constexpr ll INF = 0x3f3f3f3f3f3f3f3f;
constexpr ld PI = 3.141592653589793238462643383279;
ll get_digit(ll x) {
  return to_string(x).size();
}

ll gcd(ll x, ll y) {
  return y ? gcd(y, x % y) : x;
}

ll lcm(ll a, ll b) {
  return a / gcd(a, b) * b;
}

template <class T>
bool chmax(T& a, const T& b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}

template <class T>
bool chmin(T& a, const T& b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}

#define SEGLEN (1 << 19)
struct SegmentTree {
  vll seg;
  void initialize() {
    seg.resize(SEGLEN * 2);
    rep(i, SEGLEN * 2) seg[i] = 0;
  }

  ll find(ll l, ll r) {
    l += SEGLEN;
    r += SEGLEN;
    ll res = -1;
    while (l < r) {
      if (l % 2 == 1) {
        chmax(res, seg[l]);
        ++l;
      }
      l /= 2;
      if (r % 2 == 1) {
        chmax(res, seg[r - 1]);
        --r;
      }
      r /= 2;
    }
    return res;
  }

  void update(ll i, ll x) {
    i += SEGLEN;
    seg[i] = x;
    while (true) {
      i /= 2;
      if (i == 0) break;
      seg[i] = max(seg[i * 2], seg[i * 2 + 1]);
    }
  }
};

signed main() {
  init();
  ll N, K;
  cin >> N >> K;
  ll A_max = 300010;
  SegmentTree stree;
  stree.initialize();

  rep(i, N) {
    ll a;
    cin >> a;
    // a--;
    ll l = max(0ll, a - K);
    ll r = min(A_max - 1, a + K);
    if (l > A_max - 1) continue;
    ll val = stree.find(l, r + 1);
    // debug(a);
    // debug(l);
    // debug(r);
    // debug(kinbo);
    // ENDL;
    stree.update(a, val + 1);
  }
  // stree.update(8, 11);
  // stree.update(9, 11);

  COUT(stree.find(0, A_max));
  return 0;
}

Measured memory_bytes: 11384