class Solution {
public:
int maxAscendingSum(vector<int>& nums) {
int ans = 0;
int n = nums.size();
for(int i = 0; i < n; i++) {
int cur = 0;
for(int j = i; j < n; j++) {
if(i == j || nums[j-1] < nums[j]) {
cur += nums[j];
ans = max(ans, cur);
}else break;
}
}
return ans;
}
};
Last modification:June 20, 2021
© Allow specification reprint