def max_subarray_product(arr):
    if not arr:
        return 0
    
    max_prod = arr[0]
    min_prod = arr[0]
    result = arr[0]
    
    for i in range(1, len(arr)):
        candidates = (arr[i], max_prod * arr[i], min_prod * arr[i])
        max_prod = max(candidates)
        min_prod = min(candidates)
        result = max(result, max_prod)
    
    return result