合唱队

def solve(____):
    heights = list(map(int, heights.split(____)))
    n = len(____)
    left = [____] * n
    right = [____] * n
    for i in range(____, n):
        for j in range(____):
            if heights[i] > heights[j]:
                left[i] = max(____)
    for i in range(____):
        for j in range(____):
            if heights[i] > heights[j]:
                right[i] = max(____)
    max_len = ____
    for i in range(____):
        max_len = max(____)
    print(____)