bitonic

def max_bitonic(my_list):
    # TO DO
    sequence = []
    temp_list = [my_list[0]]
    i = 1
    while i < len(my_list):

        while my_list[i] > my_list[i-1] :
            temp_list.append(my_list[i])
            if i < len(my_list)-1:
                i += 1
            else: break

        while my_list[i] < my_list[i-1] :
            temp_list.append(my_list[i])
            if i < len(my_list)-1:
                i += 1
            else: break

        if len(temp_list) > len(sequence) :
                #sequence.copy(temp_list)
                sequence = temp_list.copy()
                temp_list.clear()
                temp_list.append(my_list[i-1])

        if i >= len(my_list)-1 : break

    return sequence

'''
def es06():
    example_list =  [4, 5, 9, 5, 6, 10, 11, 9, 6, 4, 5]
    max_bitonic_list = max_bitonic(example_list)
    print(f"La lista bitonica più lunga è lunga {len(max_bitonic_list)}: {max_bitonic_list}")


es06()
'''