<doocs>2100.Find Good Days to Rob the Bank_1.py
def goodDaysToRobBank( security: List[int], time: int) -> List[int]:
    n = len(security)
    if n <= time * 2:
        return []
    left, right = [0] * n, [0] * n
    for i in range(1, n):
        if security[i] <= security[i - 1]:
            left[i] = left[i - 1] + 1
    for i in range(n - 2, -1, -1):
        if security[i] <= security[i + 1]:
            right[i] = right[i + 1] + 1
    return [i for i in range(n) if time <= min(left[i], right[i])]
def sample_funcname ( var_0 : List [ int ] , var_3 : int ) -> List [ int ] :
    var_5 = len ( var_0 )
    if var_5 <= var_3 * 2 :
        return [ ]
    var_8 , var_9 = [ 0 ] * var_5 , [ 0 ] * var_5
    for var_12 in range ( 1 , var_5 ) :
        if var_0 [ var_12 ] <= var_0 [ var_12 - 1 ] :
            var_8 [ var_12 ] = var_8 [ var_12 - 1 ] + 1
    for var_12 in range ( var_5 - 2 , - 1 , - 1 ) :
        if var_0 [ var_12 ] <= var_0 [ var_12 + 1 ] :
            var_9 [ var_12 ] = var_9 [ var_12 + 1 ] + 1
    return [ var_12 for var_12 in range ( var_5 ) if var_3 <= min ( var_8 [ var_12 ] , var_9 [ var_12 ] ) ]
