[python] Dynamic Programming > Candies

import math
import os
import random
import re
import sys


def candies(n, arr):
    dp = [1] * n
    for i in range(1, len(arr)):
        if arr[i] > arr[i-1]:
            dp[i] = dp[i-1] + 1
    for j in range(len(arr)-1, 0, -1):
        if arr[j-1] > arr[j] and dp[j-1] <= dp[j]:
            dp[j-1] = dp[j] + 1
    return sum(dp)