class SegTree
  def initialize(n, ini, &poc)
    @n, @ini, @proc = n, ini, proc
    @a = []
    i = 1
    while i < n
      @a << Array.new(i, ini)
      i *= 2
    end
    @v = Array.new(i, ini)
    @a << @v
  end

  def inspect
    @a.inject(""){|acc, x| acc + x.join(' ') + "\n"}
  end

  def []=(i, x)
    @v[i] = x
    layer = @a.size - 2
    while layer >= 0
      i /= 2
      y = @proc.call(@a[layer + 1][i * 2], @a[layer + 1][i * 2 + 1])
      break if @a[layer][i] == y
      @a[layer][i] = y
      layer -= 1
    end
  end

  def [](i)
    @v[i]
  end

  def prop(a, b, layer = @a.size - 1)
    if a > b
      return @ini
    else
      side = @proc.call (a.odd? ? @a[layer][a] : @ini), (b.even? ? @a[layer][b] : @ini)
      @proc.call(side, prop((a + 1) / 2, (b - 1) / 2, layer - 1))
    end
  end
end

tree = SegTree.new(300_000, 0) {|a, b| a > b ? a : b}

N, K = gets.split.map(&:to_i)
N.times do
  a = gets.to_i
  left = a - K
  left = 0 if left < 0
  right = a + K
  right = 300_000 if right > 300_000
  tree[a] = 1 + tree.prop(left, right)
end
puts tree.prop(0, 300_000)