都是正数,类似最大子序和的处理
class Solution {
public:
int maxAscendingSum(vector<int>& nums) {
int res = 0, pre = nums[0], sum = nums[0];
for(auto num : nums){
if(num > pre){
sum += num;
}else{
sum = num;
}
pre = num;
res = max(res, sum);
}
return res;
}
};