





'''simple docstring'''

from collections.abc import Sequence





def 						UpperCamelCase    (							_lowerCamelCase : Sequence[float]						,	_lowerCamelCase : bool = False	):
    if not arr:
        return 0

    A__    =      0 if allow_empty_subarrays else float("-inf"	)
    A__    =      0.0
    for num in arr:
        A__    =      max(0 if allow_empty_subarrays else num						,	curr_sum + num	)
        A__    =      max(_lowerCamelCase						,	_lowerCamelCase	)

    return max_sum


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

  testmod()

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










'''simple docstring'''

def 						UpperCamelCase    (							):
    A__    =      [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]

    A__    =      6
    A__    =      1
    A__    =      19_01

    A__    =      0

    while year < 20_01:
        day += 7

        if (year % 4 == 0 and year % 1_00 != 0) or (year % 4_00 == 0):
            if day > days_per_month[month - 1] and month != 2:
                month += 1
                A__    =      day - days_per_month[month - 2]
            elif day > 29 and month == 2:
                month += 1
                A__    =      day - 29
        else:
            if day > days_per_month[month - 1]:
                month += 1
                A__    =      day - days_per_month[month - 2]

        if month > 12:
            year += 1
            A__    =      1

        if year < 20_01 and day == 1:
            sundays += 1
    return sundays


if __name__ == "__main__":
  print(solution())



