#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e9 + 7;
const long long inf = INF;
const long long MOD = 998244353;
const int MAX = 300010;
template <typename Monoid>
struct SegmentTree {
  using F = function<Monoid(Monoid, Monoid)>;
  int sz;
  vector<Monoid> seg;
  const F f;
  const Monoid M1;
  SegmentTree(int n, const F f, const Monoid &M1) : f(f), M1(M1) {
    sz = 1;
    while (sz < n) sz <<= 1;
    seg.assign(2 * sz, M1);
  }
  void set(int k, const Monoid &x) { seg[k + sz] = x; }
  void build() {
    for (int k = sz - 1; k > 0; k--) {
      seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
    }
  }
  void update(int k, const Monoid &x) {
    k += sz;
    seg[k] = x;
    while (k >>= 1) {
      seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
    }
  }
  Monoid query(int a, int b) {
    Monoid L = M1, R = M1;
    for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
      if (a & 1) L = f(L, seg[a++]);
      if (b & 1) R = f(seg[--b], R);
    }
    return f(L, R);
  }
  Monoid operator[](const int &k) const { return seg[k + sz]; }
};
signed main() {
  long long n, k;
  cin >> n >> k;
  SegmentTree<long long> seg(
      MAX + 1, [](long long a, long long b) { return max(a, b); }, 0LL);
  vector<long long> a(n);
  for (int i = (0); i < (n); i++) cin >> a[i];
  for (int i = (0); i < (n); i++) {
    long long ma = seg.query(a[i], min(a[i] + k + 1, 300000LL));
    ma = max(ma, seg.query(max(0LL, a[i] - k), a[i]));
    seg.update(a[i], ma + 1);
  }
  cout << seg.query(0, MAX + 1) << '\n';
}
