
    Given historical maintenance costs for a transit vehicle over inspection periods and the number of planned maintenance cycles, determine the highest consecutive repair expense streak that could occur when projecting this cost pattern across future cycles. The maintenance cost pattern repeats identically for each cycle, and you need to find the maximum sum of consecutive repair costs that could occur at any point during these repeated cycles.
    

    
def max_sub_array_sum_repeated(a, n, k):
    """
    Given historical maintenance costs for a transit vehicle over inspection periods and the number of planned maintenance cycles, determine the highest consecutive repair expense streak that could occur when projecting this cost pattern across future cycles. The maintenance cost pattern repeats identically for each cycle, and you need to find the maximum sum of consecutive repair costs that could occur at any point during these repeated cycles.
    

    """
def max_sub_array_sum_repeated(a, n, k):
    """
    Given historical maintenance costs for a transit vehicle over inspection periods and the number of planned maintenance cycles, determine the highest consecutive repair expense streak that could occur when projecting this cost pattern across future cycles. The maintenance cost pattern repeats identically for each cycle, and you need to find the maximum sum of consecutive repair costs that could occur at any point during these repeated cycles.
    

    """
    max_so_far = -2147483648
    max_ending_here = 0
    for i in range(n * k):
        max_ending_here = max_ending_here + a[i % n]
        if max_so_far < max_ending_here:
            max_so_far = max_ending_here
        if max_ending_here < 0:
            max_ending_here = 0
    return max_so_far