Class Solution

1813-maximum-erasure-value/maximum-erasure-value.cpp:2–25

class Solution {
public:
    int maximumUniqueSubarray(vector<int>& nums) {
        ios::sync_with_stdio(false);
cin.tie(nullptr);

        set<long long int> a;
        long long int i=0,ans=0,j=0,curr=0,n=nums.size();
        while (j<n){
            if (a.find(nums[j])==a.end()){
                a.insert(nums[j]);
                curr+=nums[j];
                ans = max(ans,curr);
                j++;
            }
            else{
                a.erase(nums[i]);
                curr-=nums[i];
                i++;
            }
        }
        return ans;
    }
};