Решение задачи: "Долины и Холмы"

def get_holm_dol(diff):
    holm_max = float('-inf')
    dol_max = float('-inf')
    res = []
    i = 0
    while i < len( diff ):
        if diff[i] == 0:
            while i < len(diff) and diff[i] == 0:
                i += 1
            res.append(0)
            continue
        if diff[i] > 0:
            pos_counter = 0
            while i < len(diff) and diff[i] > 0:
                pos_counter += 1
                i += 1
            if len(res) and res[-1] < 0:
                dol_cur = min( abs(res[-1]), pos_counter )
                dol_max = max( dol_max, dol_cur )
            res.append( pos_counter )
            continue
        if diff[i] < 0:
            neg_counter = 0
            while i < len(diff) and diff[i] < 0:
                neg_counter += 1
                i += 1
            if len(res) and res[-1] > 0:
                holm_cur = min( res[-1], neg_counter )
                holm_max = max( holm_max, holm_cur )
            res.append( -neg_counter )
            continue
    if holm_max == float('-inf'):
        holm_max = 0
    if dol_max == float('-inf'):
        dol_max = 0
    return holm_max, dol_max
#==============================================================================
n = int( input( 'n = ' ) )
arr = list( int(x) for x in input( 'arr = ' ).split() )
arr.insert(0, arr[0])
arr.append(arr[-1])
diff = [ arr[i] - arr[i-1] for i in range( 1, len(arr) ) ]
print( *get_holm_dol( diff ) )