#include <bits/stdc++.h>
using namespace std;
int n, K, A[300000 + 1], L[300000];
int lis() {
  L[0] = A[0];
  int length = 1;
  for (int i = 1; i < n; i++) {
    if (abs(L[length - 1] - A[i]) <= K) {
      L[length++] = A[i];
    } else {
      *lower_bound(L, L + length, A[i]) = A[i];
    }
  }
  return length;
}
int main() {
  cin >> n >> K;
  for (int i = 0; i < n; i++) {
    cin >> A[i];
  }
  cout << lis() << endl;
  return 0;
}
