def max_subarray_product(arr):
    if not arr:
        return 0

    max_ending_here = arr[0]
    min_ending_here = arr[0]
    best_product = arr[0]

    for value in arr[1:]:
        if value < 0:
            max_ending_here, min_ending_here = min_ending_here, max_ending_here

        max_ending_here = max(value, max_ending_here * value)
        min_ending_here = min(value, min_ending_here * value)

        best_product = max(best_product, max_ending_here)

    return best_product