Maximum Ascending Subarray Sum

class Solution {
public:
    int maxAscendingSum(vector<int>& nums) {
        int ans = 0, sum = nums[0];
        for(int i = 1; i < (int)nums.size(); ++i) {
            if(nums[i - 1] < nums[i]) sum += nums[i];
            else ans = max(ans, sum), sum = nums[i];
        }
        ans = max(ans, sum);
        return ans;
    }
};