//#define NDEBUG

#pragma region cp_template

#include <algorithm>
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <utility>
#include <vector>

namespace n91 {

  using i32 = std::int32_t;
  using i64 = std::int64_t;
  using u32 = std::uint32_t;
  using u64 = std::uint64_t;
  using isize = std::ptrdiff_t;
  using usize = std::size_t;

  struct rep {
    struct itr {
      usize i;
      constexpr itr(const usize i) noexcept : i(i) {}
      void operator++() noexcept { ++i; }
      constexpr usize operator*() const noexcept { return i; }
      constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
    };
    const itr f, l;
    constexpr rep(const usize f, const usize l) noexcept
      : f(std::min(f, l)), l(l) {}
    constexpr auto begin() const noexcept { return f; }
    constexpr auto end() const noexcept { return l; }
  };
  struct revrep {
    struct itr {
      usize i;
      constexpr itr(const usize i) noexcept : i(i) {}
      void operator++() noexcept { --i; }
      constexpr usize operator*() const noexcept { return i; }
      constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
    };
    const itr f, l;
    constexpr revrep(const usize f, const usize l) noexcept
      : f(l - 1), l(std::min(f, l) - 1) {}
    constexpr auto begin() const noexcept { return f; }
    constexpr auto end() const noexcept { return l; }
  };
  template <class T> auto md_vec(const usize n, const T& value) {
    return std::vector<T>(n, value);
  }
  template <class... Args> auto md_vec(const usize n, Args... args) {
    return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));
  }
  template <class T> constexpr T difference(const T& a, const T& b) noexcept {
    return a < b ? b - a : a - b;
  }
  template <class T> void chmin(T& a, const T& b) noexcept {
    if (b < a)
      a = b;
  }
  template <class T> void chmax(T& a, const T& b) noexcept {
    if (a < b)
      a = b;
  }
  template <class F> class rec_lambda {
    F f;

  public:
    rec_lambda(F&& f) : f(std::move(f)) {}
    template <class... Args> auto operator()(Args&&... args) const {
      return f(*this, std::forward<Args>(args)...);
    }
  };
  template <class F> auto make_rec(F&& f) { return rec_lambda<F>(std::move(f)); }
  template <class T> T scan() {
    T ret;
    std::cin >> ret;
    return ret;
  }
  constexpr char eoln = '\n';
  template <class T> T ceildiv(const T& l, const T& r) {
    return l / r + (l % r != 0 ? 1 : 0);
  }

} // namespace n91

#pragma endregion cp_template

#include <algorithm>
#include <cassert>
#include <cstddef>
#include <limits>
#include <vector>

namespace n91 {

  template <class M> class segment_tree {
    using T = typename M::value_type;

  public:
    using value_type = T;

  private:
    std::vector<T> tree;

    template <class F>
    usize search_subtree(usize index, const F f, T fold_l) const {
      while (index < size()) {
        const T temp = M::operation(fold_l, tree[index * 2]);
        if (!f(temp)) {
          index = index * 2;
        }
        else {
          fold_l = temp;
          index = index * 2 + 1;
        }
      }
      return index - size();
    }

  public:
    segment_tree() = default;

    explicit segment_tree(const usize n) : tree(n * 2, M::identity) {}

    usize size() const noexcept { return tree.size() / 2; }

    T fold(usize first, usize last) const {
      assert(first <= last);
      assert(last <= size());
      first += size();
      last += size();
      T fold_l = M::identity;
      T fold_r = M::identity;
      while (first != last) {
        if (first % 2 != 0) {
          fold_l = M::operation(fold_l, tree[first]);
          first += 1;
        }
        first /= 2;
        if (last % 2 != 0) {
          last -= 1;
          fold_r = M::operation(tree[last], fold_r);
        }
        last /= 2;
      }
      return M::operation(fold_l, fold_r);
    }

    template <class F> usize search(usize first, usize last, const F f) const {
      assert(first <= last);
      assert(last <= size());
      first += size();
      last += size();
      const usize last_cp = last;
      usize shift = 0;
      T fold_l = M::identity;
      while (first != last) {
        if (first % 2 != 0) {
          const T temp = M::operation(fold_l, tree[first]);
          if (!f(temp))
            return search_subtree(first, f, fold_l);
          fold_l = temp;
          first += 1;
        }
        first /= 2;
        last /= 2;
        shift += 1;
      }
      while (shift != 0) {
        shift -= 1;
        last = last_cp >> shift;
        if (last % 2 != 0) {
          last -= 1;
          const T temp = M::operation(fold_l, tree[last]);
          if (!f(temp))
            return search_subtree(last, f, fold_l);
          fold_l = temp;
        }
      }
      return last_cp - size();
    }

    void update(usize index, const T x) {
      assert(index < size());
      index += size();
      tree[index] = x;
      while (index != 1) {
        index /= 2;
        tree[index] = M::operation(tree[index * 2], tree[index * 2 + 1]);
      }
    }
  };

  /**
   * @brief Segment Tree
   * @docs docs/segment_tree.md
   * @see https://scrapbox.io/data-structures/Segment_Tree
   */

  template <class T> class max_monoid {
  public:
    using value_type = T;
    static constexpr T operation(const T& x, const T& y) noexcept {
      return std::max(x, y);
    }
    static constexpr T identity = std::numeric_limits<T>::lowest();
  };
  template <class T> constexpr T max_monoid<T>::identity;

  void main_() {
    /*
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    //*/
    const usize n = scan<usize>();
    const usize k = scan<usize>();
    std::vector<usize> a(n);
    for (auto& e : a) {
      std::cin >> e;
    }
    const usize m = *std::max_element(a.begin(), a.end());
    segment_tree<max_monoid<usize>> seg(m + 1);
    for (const auto e : a) {
      seg.update(
        e,
        std::max(seg.fold(e, e + 1),
          seg.fold(e - std::min(e, k), std::min(m + 1, e + k + 1)) + 1));
    }
    std::cout << seg.fold(0, m + 1) << eoln;
  }

} // namespace n91

int main() {
  n91::main_();
  return 0;
}


Measured memory_bytes: 10388