Leetcode 3487. Maximum Unique Subarray Sum After Deletion

Select a non-empty subsequence (you may delete any elements first) whose values are all distinct and maximize its sum — equivalently, pick at most one occurrence of each number (preserving order) to maximize the total.