Untitled

def solution(arr,max=100):
    
    left_bor = 0
    right_bor = len(arr)-1
    sum = 0
    if arr[left_bor] > arr[right_bor]:
        arr.reverse()
    if len(arr) > 1:
        for i in range(len(arr)):
            if arr[i] > arr[left_bor]:
                for j in range(i-1):
                    sum+= arr[left_bor]-arr[j+1]
                    
                left_bor = i
                break
    else:
        return 0
    max -=1
    if max > 49:
        sum += solution(arr[left_bor:],max)
    if max == 50:
        for i in range(len(arr)-1):
            sum += arr[left_bor] - arr[i]
        max = 50

    return sum