1695

class Solution {
public:
    int maximumUniqueSubarray(vector<int>& nums) {
        int ans = 0, sum = 0;
        vector<bool> vis(10001, false);

        for(int right=0, left=0; right<nums.size(); right++){
            sum += nums[right];
            while(vis[nums[right]]){
                sum -= nums[left];
                vis[nums[left++]] = false;
            }
            vis[nums[right]] = true;
            ans = max(ans, sum);
        }
        return ans;
    }
};