
    Given a sequence of delivery time variations across different route segments, find the continuous route combination that yields the highest efficiency score when multiplying their time variations together. The efficiency score helps identify the most optimal stretch of connected route segments that delivery vehicles should prioritize during peak hours.
    

    
def max_subarray_product(arr):
    """
    Given a sequence of delivery time variations across different route segments, find the continuous route combination that yields the highest efficiency score when multiplying their time variations together. The efficiency score helps identify the most optimal stretch of connected route segments that delivery vehicles should prioritize during peak hours.
    

    """
def max_subarray_product(arr):
    """
    Given a sequence of delivery time variations across different route segments, find the continuous route combination that yields the highest efficiency score when multiplying their time variations together. The efficiency score helps identify the most optimal stretch of connected route segments that delivery vehicles should prioritize during peak hours.
    

    """
    n = len(arr)
    max_ending_here = 1
    min_ending_here = 1
    max_so_far = 0
    flag = 0
    for i in range(0, n):
        if arr[i] > 0:
            max_ending_here = max_ending_here * arr[i]
            min_ending_here = min(min_ending_here * arr[i], 1)
            flag = 1
        elif arr[i] == 0:
            max_ending_here = 1
            min_ending_here = 1
        else:
            temp = max_ending_here
            max_ending_here = max(min_ending_here * arr[i], 1)
            min_ending_here = temp * arr[i]
        if max_so_far < max_ending_here:
            max_so_far = max_ending_here
    if flag == 0 and max_so_far == 0:
        return 0
    return max_so_far