def max_sum(arr, n):
    if n <= 0 or not arr:
        return 0

    inc = arr[:n]
    dec = arr[:n]

    for i in range(n):
        for j in range(i):
            if arr[j] < arr[i] and inc[j] + arr[i] > inc[i]:
                inc[i] = inc[j] + arr[i]

    for i in range(n - 1, -1, -1):
        for j in range(n - 1, i, -1):
            if arr[j] < arr[i] and dec[j] + arr[i] > dec[i]:
                dec[i] = dec[j] + arr[i]

    ans = 0
    for i in range(n):
        ans = max(ans, inc[i] + dec[i] - arr[i])

    return ans