Moon landing

import math

def build_tree_max(i):
    global x, max_tree, k, n
    if i >= k + n:
        return -math.inf
    if i >= k:
        max_tree[i] = x[i - k]
        return max_tree[i]
    max_tree[i] = max(build_tree_max(2 * i), build_tree_max(2 * i + 1))
    return max_tree[i]

def build_tree_min(i):
    global x, min_tree, k, n
    if i >= k + n:
        return math.inf
    if i >= k:
        min_tree[i] = x[i - k]
        return min_tree[i]
    min_tree[i] = min(build_tree_min(2 * i), build_tree_min(2 * i + 1))
    return min_tree[i]


def answer_min(a, b):
    global min_tree, k
    res = math.inf
    a += k
    b += k
    while a <= b:
        if a % 2 == 1:
            res = min(res, min_tree[a])
            a += 1
        if b % 2 == 0:
            res = min(res, min_tree[b])
            b -= 1
        a //= 2
        b //= 2
    return res


def answer_max(a, b):
    global max_tree, k
    res = -math.inf
    a += k
    b += k
    while a <= b:
        if a % 2 == 1:
            res = max(res, max_tree[a])
            a += 1
        if b % 2 == 0:
            res = max(res,  max_tree[b])
            b -= 1
        a //= 2
        b //= 2
    return res


n, a = map(int, input().split())

x = list(map(int, input().split()))
k = 2 ** math.ceil(math.log(n, 2))
max_tree = [-math.inf] * (2 * k)
min_tree = [math.inf] * (2 * k)

build_tree_min(1)
build_tree_max(1)

maxx = 1
maxx_pos = 1

if n == 1:
    print(maxx_pos, maxx)
else:
    for i in range(n):
        R = n
        L = i
        while R - L > 1 and R - i + 1 > maxx:
            M = (R + L) // 2
            if answer_max(i, M) - answer_min(i, M) <= a:
                L = M
            else:
                R = M
        if L - i + 1 >= maxx:
            maxx = L - i + 1
            maxx_pos = i + 1

    print(maxx_pos, maxx)

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED

Test 22

Verdict: ACCEPTED

Test 23

Verdict: ACCEPTED

Test 24

Verdict: ACCEPTED

Test 25

Verdict: ACCEPTED

Test 26

Verdict: ACCEPTED

Test 27

Verdict: ACCEPTED

Test 28

Verdict: ACCEPTED

Test 29

Verdict: ACCEPTED

Test 30

Verdict: ACCEPTED

Test 31

Verdict: ACCEPTED

Test 32

Verdict: ACCEPTED

Test 33

Verdict: ACCEPTED

Test 34

Verdict: ACCEPTED

Test 35

Verdict: ACCEPTED

Test 36

Verdict: ACCEPTED

Test 37

Verdict: ACCEPTED

Test 38

Verdict: ACCEPTED

Test 39

Verdict: ACCEPTED

Test 40

Verdict: ACCEPTED

Test 41

Verdict: ACCEPTED

Test 42

Verdict: ACCEPTED

Test 43

Verdict: ACCEPTED

Test 44

Verdict: ACCEPTED

Test 45

Verdict: ACCEPTED

Test 46

Verdict: ACCEPTED

Test 47

Verdict: ACCEPTED

Test 48

Verdict: ACCEPTED

Test 49

Verdict: ACCEPTED

Test 50

Verdict: ACCEPTED

Test 51

Verdict: ACCEPTED

Test 52

Verdict: ACCEPTED

Test 53

Verdict: ACCEPTED

Test 54

Verdict: ACCEPTED

Test 55

Verdict: ACCEPTED

Test 56

Verdict: ACCEPTED

Test 57

Verdict: ACCEPTED

Test 58

Verdict: ACCEPTED

Test 59

Verdict: ACCEPTED

Test 60

Verdict: ACCEPTED

Test 61

Verdict: ACCEPTED

Test 62

Verdict: ACCEPTED

Test 63

Verdict: ACCEPTED

Test 64

Verdict: ACCEPTED