


from collections.abc import Sequence



def   snake_case						(				_a:     Sequence[float]		,   _a:     bool = False							)->		float:
      '''simple docstring'''


      if not arr:
            return 0

      lowerCamelCase__           =		0 if allow_empty_subarrays else float('-inf'							)
      lowerCamelCase__           =		0.0
      for num in arr:
            lowerCamelCase__           =		max(0 if allow_empty_subarrays else num		,   curr_sum + num							)
            lowerCamelCase__           =		max(_a		,   _a							)

      return max_sum


if __name__ == "__main__":
   from doctest import testmod

   testmod()

   _snake_case          =							[-2, 1, -3, 4, -1, 2, 1, -5, 4]
   print(f"""{max_subarray_sum(nums) = }""")







"""simple docstring"""


def   snake_case						(				_a:     List[Any]		,   _a:     Any		,   _a:     str		,   _a:     List[Any]							)->		List[Any]:
      '''simple docstring'''


      lowerCamelCase__           =		[False] * len(_a							)
      lowerCamelCase__           =		[]
      queue.append(_a							)
      lowerCamelCase__           =		True

      while queue:
            lowerCamelCase__           =		queue.pop(0							)
            for ind in range(len(graph[u]							)							):
                  if visited[ind] is False and graph[u][ind] > 0:
                        queue.append(_a							)
                        lowerCamelCase__           =		True
                        lowerCamelCase__           =		u

      return visited[t]



def   snake_case						(				_a:     List[Any]		,   _a:     str		,   _a:     List[str]							)->		Optional[int]:
      '''simple docstring'''


      lowerCamelCase__           =		[-1] * (len(_a							))
      lowerCamelCase__           =		0
      while bfs(_a		,   _a		,   _a		,   _a							):
            lowerCamelCase__           =		float('Inf'							)
            lowerCamelCase__           =		sink

            while s != source:
                  # Find the minimum value in select path
                  lowerCamelCase__           =		min(_a		,   graph[parent[s]][s]							)
                  lowerCamelCase__           =		parent[s]

            max_flow += path_flow
            lowerCamelCase__           =		sink

            while v != source:
                  lowerCamelCase__           =		parent[v]
                  graph[u][v] -= path_flow
                  graph[v][u] += path_flow
                  lowerCamelCase__           =		parent[v]
      return max_flow


_snake_case          =							[
    [0, 16, 13, 0, 0, 0],
    [0, 0, 10, 12, 0, 0],
    [0, 4, 0, 0, 14, 0],
    [0, 0, 9, 0, 0, 20],
    [0, 0, 0, 7, 0, 4],
    [0, 0, 0, 0, 0, 0],
]

_snake_case      ,					_snake_case          =							0, 5






print(ford_fulkerson(graph, source, sink))



