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

    max_ending = min_ending = result = arr[0]

    for x in arr[1:]:
        if x < 0:
            max_ending, min_ending = min_ending, max_ending

        max_ending = max(x, max_ending * x)
        min_ending = min(x, min_ending * x)

        result = max(result, max_ending)

    return result