public static long candies(int n, List<Integer> arr) {
        long[] candies = new long[n];
        Arrays.fill(candies, 1);
        // Left to right
        for (int i=1; i<n; i++) {
            if (arr.get(i)>arr.get(i-1)) {
                candies[i] = candies[i-1]+1;
            }
        }
        // Right to left
        for (int i=n-2; i>=0; i--) {
            if (arr.get(i)>arr.get(i+1)) {
                candies[i] = Math.max(candies[i], candies[i+1]+1);
            }
        }
        return Arrays.stream(candies).sum();
    }

long long candies(unsigned n, vector<unsigned> arr) {
    vector<unsigned> candies(arr.size(), 1);
    
    for(unsigned i = 1; i < n; i++)
        if(arr[i] > arr[i-1])
            candies[i] = candies[i-1] + 1;
    
    for(int i = n - 2; i >= 0 ; i--)
        if(arr[i] > arr[i + 1])
            candies[i] = max(candies[i + 1] + 1, candies[i]);

    return accumulate(candies.begin(), candies.end(), static_cast<long long>(0));   
}

def candies(n, arr):
    # Write your code here
    total_candy = [1] * n
    for i in range(1, n):
        if arr[i] > arr[i - 1]:
            total_candy[i] = total_candy[i - 1] + 1
    for i in range(n - 2, -1, -1):
        if arr[i] > arr[i + 1]:
            total_candy[i] = max(total_candy[i], total_candy[i + 1] + 1)
    
    # The result is the sum of all total_candy
    return sum(total_candy)