from collections import deque

def solution(l, t):
    n = len(l)
    max_q, min_q = deque(), deque()
    res, left = 0, 0
    for r in range(n):
        while max_q and l[max_q[-1]] <= l[r]:
            max_q.pop()
        max_q.append(r)
        while min_q and l[min_q[-1]] >= l[r]:
            min_q.pop()
        min_q.append(r)
        while l[max_q[0]] - l[min_q[0]] > t:
            left += 1
            if max_q[0] < left:
                max_q.popleft()
            if min_q[0] < left:
                min_q.popleft()
        res = max(res, r - left + 1)
    return res