题解 | 游游的最长稳定子数组

def longest_stable_subarray(n, arr):
    max_len = 1  # 最长稳定子数组长度
    curr_len = 1  # 当前稳定子数组长度
    
    for i in range(1, n):
        if abs(arr[i] - arr[i-1]) <= 1:
            curr_len += 1
            max_len = max(max_len, curr_len)
        else:
            curr_len = 1
            
    return max_len

# 读取输入
n = int(input())
arr = list(map(int, input().split()))

# 输出结果
print(longest_stable_subarray(n, arr))