comefrom: <doocs>1800.Maximum Ascending Subarray Sum_1.py
code: def maxAscendingSum( nums: List[int]) -> int:
      res, cur = 0, nums[0]
      for i in range(1, len(nums)):
          if nums[i] > nums[i - 1]:
              cur += nums[i]
          else:
              res = max(res, cur)
              cur = nums[i]
      res = max(res, cur)
      return res
masked: def sample_funcname ( var_0 : List [ int ] ) -> int :
      var_4 , var_5 = 0 , var_0 [ 0 ]
      for var_9 in range ( 1 , len ( var_0 ) ) :
          if var_0 [ var_9 ] > var_0 [ var_9 - 1 ] :
              var_5 += var_0 [ var_9 ]
          else :
              var_4 = max ( var_4 , var_5 )
              var_5 = var_0 [ var_9 ]
      var_4 = max ( var_4 , var_5 )
      return var_4
  