#include <bits/stdc++.h>
using namespace std;
auto start = std::chrono::system_clock::now();
inline void skj() {
  std::chrono::time_point<std::chrono::system_clock> end;
  end = std::chrono::system_clock::now();
  std::chrono::duration<double> elapsed_seconds = end - start;
  std::time_t end_time = std::chrono::system_clock::to_time_t(end);
  cerr << "Time taken " << elapsed_seconds.count() * 1000 << "\n";
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
long long csrand(long long l = 0, long long r = 1e9) {
  uniform_int_distribution<long long> uid(l, r);
  return uid(rng);
}
struct custom_hash {
  static uint64_t splitmix64(uint64_t x) {
    x += 0x9e3779b97f4a7c15;
    x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
    x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
    return x ^ (x >> 31);
  }
  size_t operator()(uint64_t x) const {
    static const uint64_t FIXED_RANDOM =
        chrono::steady_clock::now().time_since_epoch().count();
    return splitmix64(x + FIXED_RANDOM);
  }
};
inline long long binexp(long long a, long long b, long long m) {
  if (a == 0) {
    return 0;
  }
  long long res = 1;
  a %= m;
  while (b) {
    if (b & 1) res = (res * 1ll * a) % m;
    a = (a * 1ll * a) % m;
    b >>= 1;
  }
  return res;
}
inline long long binmul(long long a, long long b, long long m) {
  a %= m;
  long long res = 0;
  while (b) {
    if (b & 1) {
      res = (res + a) % m;
    }
    a = (a + a) % m;
    b >>= 1;
  }
  return res;
}
long long seg[1200000];
long long querySeg(long long node, long long s, long long e, long long l,
                   long long r) {
  if (s > r || e < l || s > r) return 0;
  if (s >= l && e <= r) return seg[node];
  long long mid = (s + e) >> 1, p = node << 1, q = p | 1;
  return max(querySeg(p, s, mid, l, r), querySeg(q, mid + 1, e, l, r));
}
void updateSeg(long long node, long long s, long long e, long long ind,
               long long x) {
  if (s > ind || e < ind) {
    return;
  }
  if (s == e) {
    seg[node] = max(seg[node], x);
  } else {
    long long mid = (s + e) >> 1, p = node << 1, q = p | 1;
    updateSeg(p, s, mid, ind, x);
    updateSeg(q, mid + 1, e, ind, x);
    seg[node] = max(seg[p], seg[q]);
  }
}
void solve() {
  long long n, k;
  cin >> n >> k;
  vector<long long> arr(n);
  for (long long i = 0; i < n; i++) {
    cin >> arr[i];
  }
  long long ans = 1;
  for (long long i = 0; i < n; i++) {
    long long x =
        querySeg(1, 1, n, max(1ll, arr[i] - k), min(300000ll, arr[i] + k));
    ans = max(x + 1, ans);
    updateSeg(1, 1, n, arr[i], x + 1);
  }
  cout << ans << "\n";
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  long long a = 1;
  while (t--) {
    solve();
    a++;
  }
  return 0;
}
