class SegTree
  attr_accessor(:arr, :size)

	def initialize(n)
		@size = 1<<(n-1).bit_length
		@arr = Array.new(@size*2-1,0)
	end

  def update(i,x)
    i += @size - 1
    @arr[i] = x
    while i > 0
      i = (i-1)/2
      @arr[i] = op(@arr[i*2+1], @arr[i*2+2])
    end
  end

  def query(a,b)
    query_re(a,b+1,0,0,@size)
  end

  def query_re(a,b,k,l,r)
    if r <= a || b <= l
      return -1
    elsif a <= l && r <= b
      @arr[k]
    else
      vl = query_re(a, b, k*2+1, l, (l+r)/2)
      vr = query_re(a, b, k*2+2, (l+r)/2, r)
      op(vl,vr)
    end
  end

  def op(a,b)
    [a,b].max
  end
end

n,k = gets.chomp.split(" ").map(&:to_i)
a = n.times.map{gets.to_i}
seg = SegTree.new(a.max)
n.times do |i|
  l = [a[i]-1-k,0].max
  r = [a[i]-1+k,a.max-1].min
  max = seg.query(l,r)
  seg.update(a[i]-1,max+1)
end
puts seg.query(0,n-1)