#line 1 "/workspaces/compro/lib/template.hpp"


#line 1 "/workspaces/compro/lib/io/vector.hpp"
#include <iostream>
#include <vector>

#ifndef IO_VECTOR
#define IO_VECTOR

template <class T> std::ostream &operator<<(std::ostream &out, const std::vector<T> &v) {
  int size = v.size();
  for (int i = 0; i < size; i++) {
    std::cout << v[i];
    if (i != size - 1)
      std::cout << " ";
  }
  return out;
}

template <class T> std::istream &operator>>(std::istream &in, std::vector<T> &v) {
  for (auto &el : v) {
    std::cin >> el;
  }
  return in;
}

#endif
#line 4 "/workspaces/compro/lib/template.hpp"
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
#define coutd(n) cout << fixed << setprecision(n)
#define ll long long int
#define vl vector<ll>
#define vi vector<int>
#define MM << " " <<

using namespace std;

template <class T> void say(bool val, T yes, T no) { cout << (val ? yes : no) << "\n"; }

void say(bool val, string yes = "Yes", string no = "No") { say<string>(val, yes, no); }

template <class T> void chmin(T &a, T b) {
  if (a > b)
    a = b;
}

template <class T> void chmax(T &a, T b) {
  if (a < b)
    a = b;
}

// C++ 17に完全移行したら消す
// 最大公約数を求める
template <class T> T gcd(T n, T m) { return n ? gcd(m % n, n) : m; }

// 最小公倍数を求める
template <class T> T lcm(T n, T m) {
  int g = gcd(n, m);
  return n * m / g;
}

// 重複を消す。計算量はO(NlogN)
template <class T> void unique(std::vector<T> &v) {
  std::sort(v.begin(), v.end());
  v.erase(std::unique(v.begin(), v.end()), v.end());
}


#line 2 "main.cpp"

#line 3 "/workspaces/compro/lib/segment_tree.hpp"
#ifndef SEGMENT_TREE
#define SEGMENT_TREE

template <class T> class SegmentTree {
public:
  SegmentTree(const int n, const T id, std::function<T(T, T)> op, std::function<T(T, T)> updateOp)
      : id(id), op(op), updateOp(updateOp) {
    leafNum = 1;
    while (leafNum < n)
      leafNum *= 2;
    data = std::vector<T>(2 * leafNum - 1, id);
  }

  void update(const int index, const T value) {
    int i = leaf(index);
    data[i] = updateOp(data[i], value);
    while (i > 0) {
      i = parent(i);
      data[i] = op(data[rightChildIndex(i)], data[leftChildIndex(i)]);
    }
  }

  T find(const int l, const int r) { return query(l, r, 0, 0, leafNum); }

private:
  int leftChildIndex(const int parent) { return parent * 2 + 1; }

  int rightChildIndex(const int parent) { return parent * 2 + 2; }

  int parent(const int child) { return (child - 1) / 2; }

  int leaf(const int index) { return index + leafNum - 1; }

  T query(const int l, const int r, const int node, const int al, const int ar) {
    if (r <= al || ar <= l)
      return id;
    if (l <= al && ar <= r)
      return data[node];
    int mid = (al + ar) / 2;
    T leftValue = query(l, r, leftChildIndex(node), al, mid);
    T rightValue = query(l, r, rightChildIndex(node), mid, ar);
    return op(leftValue, rightValue);
  }

private:
  std::vector<T> data;
  int leafNum;
  T id;
  std::function<T(T, T)> op;
  std::function<T(T, T)> updateOp;
};
#endif
#line 4 "main.cpp"

long long solve(int N, int K, const std::vector<int> &A) {
  SegmentTree<int> seg(
      300001, 0, [](int a, int b) -> int { return std::max(a, b); }, [](int _, int b) -> int { return b; });

  REP(i, N) { seg.update(A[i], seg.find(max(0, A[i] - K), min(300001, A[i] + K + 1)) + 1); }

  return seg.find(0, 300001);
}

// generated by online-judge-template-generator v4.7.1 (https://github.com/online-judge-tools/template-generator)
int main() {
  int N;
  int K;
  std::cin >> N;
  std::vector<int> A(N);
  std::cin >> K;
  for (int i = 0; i < N; ++i) {
    std::cin >> A[i];
  }
  auto ans = solve(N, K, A);
  std::cout << ans << std::endl;
  return 0;
}


Measured memory_bytes: 8552