#include <iostream>
#include <string>
#include <utility>
#include <stack>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <climits>
#include <set>
#include <numeric>
#include <iomanip>
#include <cmath>
#include <cstring>
#include <cfloat>
using namespace std;
int sqrtN = 320;
struct SqrtDecomposition{
    int N, K;
    vector <long long> data;
    //vector <long long> bucketUpdatedLazy;
    vector <long long> bucketAdded;
    vector <long long> bucketMin;
    
    SqrtDecomposition(int n){
        N = n;
        K = (N + sqrtN - 1) / sqrtN;
        data.assign(N + sqrtN, 0);
        //bucketUpdatedLazy.assign(K, -1);
        bucketMin.assign(K, 0);
        bucketAdded.assign(K, 0);
    }
 
    /*
    void propagateLazy(int k){
        if(bucketUpdatedLazy[k] < 0){
            return;
        }
        for(int i = 0; i < sqrtN; i++){
            data[k * sqrtN + i] = bucketUpdatedLazy[k];
        }
        bucketMin[k] = bucketUpdatedLazy[k];
        bucketUpdatedLazy[k] = -1;
    }
    */

    void updateMin(int k){
        bucketMin[k] = data[k * sqrtN];
        for(int i = 0; i < sqrtN; i++){
            bucketMin[k] = min(data[k * sqrtN + i], bucketMin[k]);
        }
    }

    long long get(int x){
        return data[x] + bucketAdded[x / sqrtN];
    }
    
    long long find(int x, int y){
        //propagateLazy(x / sqrtN);
        //propagateLazy((y - 1) / sqrtN);
        long long ans = data[x] + bucketAdded[x / sqrtN];
        if(y - x < sqrtN){
            for(int i = x; i < y; i++){
                ans = min(ans, data[i] + bucketAdded[i / sqrtN]);
            }
            return ans;
        }
        for(int i = x / sqrtN + 1; i < y / sqrtN; i++){
            ans = min(ans, bucketMin[i] + bucketAdded[i]);
        }

        for(int i = x; i < (x / sqrtN + 1) * sqrtN; i++){
            ans = min(ans, data[i] + bucketAdded[i / sqrtN]);
        }
        for(int i = y / sqrtN * sqrtN; i < y; i++){
            ans = min(ans, data[i] + bucketAdded[i / sqrtN]);
        }
        return ans;
    }
 

    void add(int x, int y, long long a){
        if(y - x < sqrtN){
            for(int i = x; i < y; i++){
                data[i] += a;
            }
            updateMin(x / sqrtN);
            updateMin((y - 1) / sqrtN);
            return;
        }
        for(int i = x / sqrtN + 1; i < y / sqrtN; i++){
            bucketAdded[i] += a;
        }

        //propagateLazy(x / sqrtN);
        for(int i = x; i < (x / sqrtN + 1) * sqrtN; i++){
            data[i] += a;
        }
        updateMin(x / sqrtN);
        //propagateLazy((y - 1)/ sqrtN);
        for(int i = y / sqrtN * sqrtN; i < y; i++){
            data[i] += a;
        }
        updateMin((y - 1) / sqrtN);
    }
     
};
int A[300000];

int main(){
  int N;
  int K;
  cin >> N >> K;
  int max_A = 0;
  for(int i = 0; i < N; i++){
    cin >> A[i];
    max_A = max(A[i], max_A);
  }

  SqrtDecomposition sq(max_A + 1);
  for(int i = 0; i < N; i++){
    int tmp = sq.find(max(0, A[i] - K), min(A[i] + K + 1, max_A + 1));
    int prev = sq.find(A[i], A[i] + 1);
    sq.add(A[i], A[i] + 1, - prev);
    sq.add(A[i], A[i] + 1, tmp - 1);
  }
  cout << - sq.find(0, max_A + 1) << endl;
  return 0;
}


Measured memory_bytes: 6684