Distribute Candy

• Time : $O(n)$
• Space : $O(n)$

#include <bits/stdc++.h>

int Solution::candy(vector<int> &A) {
    int n = A.size();
    vector<int> dp(n,1);
    for(int i = 1; i < n; i++) {
        if(A[i] > A[i-1]) dp[i] = max(dp[i], dp[i-1] + 1);
    }
    for(int i = n - 2; i >= 0; i--) {
        if(A[i] > A[i+1]) dp[i] = max(dp[i], dp[i+1] + 1);
    }
    
    return accumulate(begin(dp), end(dp), 0);
}