class Solution:
def maximumUniqueSubarray(self, nums: List[int]) -> int:
ans = 0
max_ = -float("inf")
wins = collections.defaultdict(int)
l = r = 0
while r < len(nums):
n1 = nums[r]
wins[n1] += 1
ans += n1
r += 1
while wins[n1] > 1:
n2 = nums[l]
wins[n2] -= 1
ans -= n2
l += 1
max_ = max(ans,max_)
return max_