# https://leetcode.com/problems/maximum-ascending-subarray-sum

from typing import List

class Solution:
    def maxAscendingSum(self, nums: List[int]) -> int:
        result = 0
        curr = nums[0]
        for i in range(1, len(nums)):
            if nums[i - 1] >= nums[i]:
                result = max(result, curr)
                curr = 0
            curr += nums[i]
        result = max(result, curr)
        return result