GoalScope — max_sum (Qwen2.5-Coder-32B-Instruct) — hover a token to see the patched verbalization
↵
<code>↵
def max_sum(arr):↵
"""Function to find the maximum sum of a bitonic subsequence."""↵
n = len(arr)↵
inc = [0] * n↵
dec = [0] * n↵
↵
for i in range(n):↵
inc[i] = arr[i]↵
↵
for i in range(1, n):↵
for j in range(i):↵
if arr[i] > arr[j] and inc[i] < inc[j] + arr[i]:↵
inc[i] = inc[j] + arr[i]↵
↵
for i in reversed(range(n)):↵
dec[i] = arr[i]↵
↵
for i in reversed(range(n - 1)):↵
for j in range(i + 1, n):↵
if arr[i] > arr[j] and dec[i] < dec[j] + arr[i]:↵
dec[i] = dec[j] + arr[i]↵
↵
maximum = 0↵
for i in range(n):↵
maximum = max((inc[i] + dec[i] - arr[i]), maximum)↵
↵
return maximum↵
</code>