
    Given a list of delivery route durations, find the highest possible throughput value obtained by multiplying the times of selected routes, where each selected route must take longer than the previous one to account for expanding delivery zones. The selected routes must maintain their relative order from the original sequence to preserve the geographical flow of deliveries.
    

    
def max_product(arr):
    """
    Given a list of delivery route durations, find the highest possible throughput value obtained by multiplying the times of selected routes, where each selected route must take longer than the previous one to account for expanding delivery zones. The selected routes must maintain their relative order from the original sequence to preserve the geographical flow of deliveries.
    

    """
def max_product(arr):
    """
    Given a list of delivery route durations, find the highest possible throughput value obtained by multiplying the times of selected routes, where each selected route must take longer than the previous one to account for expanding delivery zones. The selected routes must maintain their relative order from the original sequence to preserve the geographical flow of deliveries.
    

    """
    n = len(arr)
    mpis = arr[:]
    for i in range(n):
        current_prod = arr[i]
        j = i + 1
        while j < n:
            if arr[j - 1] > arr[j]:
                break
            current_prod *= arr[j]
            if current_prod > mpis[j]:
                mpis[j] = current_prod
            j = j + 1
    return max(mpis)