Alitaulukot

# NOTE: loops through the list once
# saves global max and min
# if M - m > k for some j, move j forward until the clause
# is true, and every iteration add how many values are 'in play'
# (i - j + 1) 

n, k = (int(a) for a in input().split())
xs = [int(x) for x in input().split()]


total = 0
m, M = xs[0], xs[0]
j = 0
for i, x in enumerate(xs):
    m = min(x, m)
    M = max(x, M)
    if (M - m) > k:
        j += 1
        while abs(xs[j]-xs[i]) > k:
            j += 1
        m, M = xs[j], xs[j]
    total += i - j + 1

print(total)

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

Test 4

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

Test 6

Group: 2, 3

Verdict: ACCEPTED

Test 7

Group: 2, 3

Verdict: WRONG ANSWER

Test 8

Group: 2, 3

Verdict: WRONG ANSWER

Test 9

Group: 2, 3

Verdict: WRONG ANSWER

Test 10

Group: 2, 3

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: ACCEPTED

Test 12

Group: 3

Verdict: WRONG ANSWER

Test 13

Group: 3

Verdict: WRONG ANSWER

Test 14

Group: 3

Verdict: WRONG ANSWER

Test 15

Group: 3

Verdict: ACCEPTED

Test 16

Group: 3

Verdict: ACCEPTED

Test 17

Group: 3

Verdict: ACCEPTED