如何在python中查找大于均值的列表的最长连续子序列

def find_longest_subsequence(lst):
    mean = sum(lst) / len(lst)
    longest_subsequence = []
    longest_length = 0
    
    for i in range(len(lst)):
        current_subsequence = [lst[i]]
        current_length = 1
        
        for j in range(i+1, len(lst)):
            if lst[j] > mean:
                current_subsequence.append(lst[j])
                current_length += 1
            else:
                break
        
        if current_length > longest_length:
            longest_subsequence = current_subsequence
            longest_length = current_length
    
    return longest_subsequence

# 示例用法
lst = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
result = find_longest_subsequence(lst)
print(result)