import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10**9)
INF = 10**9
mod = 10**9+7

N,K = I()
A = [i() for _ in range(N)]
d = []
for i in range(N-1):
    d.append(A[i+1]-A[i])
p = 0
ans = 0
for i in range(N-1):
    if p != 0:
        p -= 1
        continue
    ans += 1
    if abs(d[i]) > K:
        n = d[i]
        for j in range(i+1,N-1-i):
            p += 1
            n += d[j]
            if abs(n) <= K:
                break
print(ans)