def max_subarray_product(arr):
    if not arr:
        return 0
    
    max_product = arr[0]
    min_so_far = arr[0]
    max_so_far = arr[0]
    
    for num in arr[1:]:
        candidates = (num, max_so_far * num, min_so_far * num)
        max_so_far = max(candidates)
        min_so_far = min(candidates)
        max_product = max(max_product, max_so_far)
    
    return max_product