Moon landing

import math

def build_tree_max(i):
    global x, max_tree, k, n
    if i >= k + n:
        return 0
    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 0
    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 = 0
    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 = 0
    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 = [0] * (2 * k)
min_tree = [0] * (2 * k)

build_tree_min(1)
build_tree_max(1)

maxx = 1
maxx_pos = 1

for i in range(n):
    for j in range(i + 1, n):
        if j - i + 1 >= maxx and answer_max(i, j) - answer_min(i, j) <= a:
            maxx = j - i + 1
            maxx_pos = i + 1

print(maxx_pos, maxx)

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: WRONG ANSWER

Test 14

Verdict: ACCEPTED

Test 15

Verdict: WRONG ANSWER

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: WRONG ANSWER

Test 19

Verdict: WRONG ANSWER

Test 20

Verdict: WRONG ANSWER

Test 21

Verdict: ACCEPTED

Test 22

Verdict: WRONG ANSWER

Test 23

Verdict: WRONG ANSWER

Test 24

Verdict: ACCEPTED

Test 25

Verdict: WRONG ANSWER

Test 26

Verdict: ACCEPTED

Test 27

Verdict: ACCEPTED

Test 28

Verdict: ACCEPTED

Test 29

Verdict: WRONG ANSWER

Test 30

Verdict: WRONG ANSWER

Test 31

Verdict: ACCEPTED

Test 32

Verdict: WRONG ANSWER

Test 33

Verdict: WRONG ANSWER

Test 34

Verdict: WRONG ANSWER

Test 35

Verdict: WRONG ANSWER

Test 36

Verdict: WRONG ANSWER

Test 37

Verdict: WRONG ANSWER

Test 38

Verdict: WRONG ANSWER

Test 39

Verdict: WRONG ANSWER

Test 40

Verdict: WRONG ANSWER

Test 41

Verdict: ACCEPTED

Test 42

Verdict: WRONG ANSWER

Test 43

Verdict: WRONG ANSWER

Test 44

Verdict: WRONG ANSWER

Test 45

Verdict: WRONG ANSWER

Test 46

Verdict: WRONG ANSWER

Test 47

Verdict: WRONG ANSWER

Test 48

Verdict: ACCEPTED

Test 49

Verdict: WRONG ANSWER

Test 50

Verdict: WRONG ANSWER

Test 51

Verdict: ACCEPTED

Test 52

Verdict: WRONG ANSWER

Test 53

Verdict: TIME LIMIT EXCEEDED

Test 54

Verdict: TIME LIMIT EXCEEDED

Test 55

Verdict: TIME LIMIT EXCEEDED

Test 56

Verdict: TIME LIMIT EXCEEDED

Test 57

Verdict: TIME LIMIT EXCEEDED

Test 58

Verdict: TIME LIMIT EXCEEDED

Test 59

Verdict: TIME LIMIT EXCEEDED

Test 60

Verdict: TIME LIMIT EXCEEDED

Test 61

Verdict: TIME LIMIT EXCEEDED

Test 62

Verdict: TIME LIMIT EXCEEDED

Test 63

Verdict: TIME LIMIT EXCEEDED

Test 64

Verdict: TIME LIMIT EXCEEDED