create a function that accepts a list and returns the maximum sum of the elements in any contiguous subsequence that are sorted in ascending order $($e$.$g$.$ non$-$decreasing subsequence$)$