#include <bits/stdc++.h>
using namespace std;
int t = 1000001;
class myData {
 public:
  int t;
  int x;
  int y;
  int d;
  myData(int t, int x, int y, int d) : t(t), x(x), y(y), d(d) {}
  bool operator<(const myData& a) const { return (this->t < a.t); }
};
long long exponentMod(long long A, long long B) {
  if (A == 0) return 0;
  if (B == 0) return 1;
  long long y;
  if (B % 2 == 0) {
    y = exponentMod(A, B / 2);
    y = (y * y);
  } else {
    y = A;
    y = (y * exponentMod(A, B - 1));
  }
  return (long long)((y));
}
pair<int, int> factorize(long long n) {
  int ans = 1;
  int c = 0;
  for (long long i = 2; i * i <= n; ++i) {
    while (n % i == 0) {
      if (i != 2) ans *= i, c++;
      n /= i;
    }
  }
  if (n != 1) {
    if (n != 2) ans *= n, c++;
  }
  return {ans, c};
}
map<long long, long long> bit;
int N1 = 2e5;
void update(long long i) {
  for (; i <= N1; i += i & (-i)) bit[i]++;
}
long long get(long long i) {
  long long ans = 0;
  for (; i > 0; i -= i & (-i)) ans += bit[i];
  return ans;
}
int now;
bool sortByVal(const myData& a, const myData& b) { return (a.t < b.t); }
long long ans1 = 0;
int spf[100003];
long long calc[100003 + 1];
void sieve() {
  spf[1] = 1;
  for (int i = 2; i < 100003; i++) spf[i] = i;
  for (int i = 4; i < 100003; i += 2) spf[i] = 2;
  for (int i = 3; i * i < 100003; i++) {
    if (spf[i] == i) {
      for (int j = i * i; j < 100003; j += i)
        if (spf[j] == j) spf[j] = i;
    }
  }
}
set<int> getFactorization(int x) {
  set<int> ret;
  while (x != 1) {
    ret.insert(spf[x]);
    x = x / spf[x];
  }
  return ret;
}
bool prime[100003 + 1];
void sieve2() {
  memset(prime, true, sizeof(prime));
  for (int p = 2; p * p <= 100003; p++) {
    if (prime[p] == true) {
      for (int i = p * p; i <= 100003; i += p) prime[i] = false;
    }
  }
}
int MEX(int a[], int n) {
  set<int> s;
  for (int i = 0; i < n; i++) {
    s.insert(a[i]);
  }
  int c = 0;
  for (auto i = s.begin(); i != s.end(); i++) {
    if (*i == c) {
      c++;
    } else
      break;
  }
  return c;
}
int smallestDivisor(int n) {
  if (n % 2 == 0) return 2;
  for (int i = 3; i * i <= n; i += 2) {
    if (n % i == 0) return i;
  }
  return n;
}
int setBitNumber(int n) {
  if (n == 0) return 0;
  int msb = 0;
  n = n / 2;
  while (n != 0) {
    n = n / 2;
    msb++;
  }
  return msb;
}
int getMid(int s, int e) { return s + (e - s) / 2; }
int MaxUtil(int* st, int ss, int second, int l, int r, int node) {
  if (l <= ss && r >= second) return st[node];
  if (second < l || ss > r) return -1;
  int mid = getMid(ss, second);
  return max(MaxUtil(st, ss, mid, l, r, 2 * node + 1),
             MaxUtil(st, mid + 1, second, l, r, 2 * node + 2));
}
int constructSTUtil(int arr[], int ss, int second, int* st, int si) {
  if (ss == second) {
    st[si] = arr[ss];
    return arr[ss];
  }
  int mid = getMid(ss, second);
  st[si] = max(constructSTUtil(arr, ss, mid, st, si * 2 + 1),
               constructSTUtil(arr, mid + 1, second, st, si * 2 + 2));
  return st[si];
}
int* constructST(int arr[], int n) {
  int x = (int)(ceil(log2(n)));
  int max_size = 2 * (int)pow(2, x) - 1;
  int* st = new int[max_size];
  constructSTUtil(arr, 0, n - 1, st, 0);
  return st;
}
void updateValue(int arr[], int* st, int ss, int second, int index, int value,
                 int node) {
  if (ss == second) {
    arr[index] = value;
    st[node] = value;
  } else {
    int mid = getMid(ss, second);
    if (index >= ss && index <= mid)
      updateValue(arr, st, ss, mid, index, value, 2 * node + 1);
    else
      updateValue(arr, st, mid + 1, second, index, value, 2 * node + 2);
    st[node] = max(st[2 * node + 1], st[2 * node + 2]);
  }
  return;
}
int longest_subseq(int n, int k, int s[]) {
  vector<int> dp(n, 0);
  int max_length[300001] = {0};
  int* st = constructST(max_length, 300001);
  for (int i = 0; i < n; i++) {
    int curr = s[i];
    int lower = max(0, curr - k);
    int upper = min(30000, curr + k);
    int m1 = MaxUtil(st, 0, 300000, lower, upper, 0);
    dp[i] = max(dp[i], m1 + 1);
    updateValue(max_length, st, 0, 300000, curr, max(dp[i], max_length[curr]),
                0);
  }
  int ans = 0;
  for (int i : dp) ans = max(i, ans);
  return ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n, k;
  cin >> n >> k;
  int a[n];
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  cout << longest_subseq(n, k, a);
  return 0;
}
