Kadane's Algorithm (sort of...)
Code
# Code
```cpp []
class Solution {
public:
    long long maximumTotalCost(vector<int>& nums) {
        if (nums.size() == 1) return nums.front();
        vector<long long> dp(nums.size());
        dp[0] = nums[0];
        dp[1] = max(nums[0] + nums[1], nums[0] - nums[1]);
        for (int i = 2; i < nums.size(); i++) {
            dp[i] = max(dp[i - 1] + nums[i], dp[i - 2] + nums[i - 1] - nums[i]);
        }
        return dp.back();
    }
};
```
['C++']