


"""simple docstring"""



from __future__ import annotations







def   __lowerCAmelCase						(						lowercase  :  list[int]			)     ->						int:


    """simple docstring"""





    snake_case   :				int				 =   len(lowercase			) // 2

    # choose the middle 3 elements
    snake_case   :				str				 =   lst[m - 1 : m + 2]

    # if middle element is peak
    if three[1] > three[0] and three[1] > three[2]:
        return three[1]

    # if increasing, recurse on right
    elif three[0] < three[2]:
        if len(lst[:m]			) == 2:
            m -= 1
        return peak(lst[m:]			)

    # decreasing
    else:
        if len(lst[:m]			) == 2:
            m += 1
        return peak(lst[:m]			)


if __name__ == "__main__":
  import doctest

  doctest.testmod()









"""simple docstring"""



from __future__ import annotations

import numpy as np







def   __lowerCAmelCase						(						lowercase  :  list[float]			)     ->						Any:


    """simple docstring"""





    return np.maximum(0						,							lowercase			)


if __name__ == "__main__":
  print(np.array(relu([-1, 0, 5])))  # --> [0, 0, 5]





