# 1695. Maximum Erasure Value | LeetCode Solution

## 1695. Maximum Erasure Value | LeetCode Solution

You are given an array of positive integers `nums` and want to erase a subarray containing unique elements. The score you get by erasing the subarray is equal to the sum of its elements.

Return the maximum score you can get by erasing exactly one subarray.

An array `b` is called to be a subarray of `a` if it forms a contiguous subsequence of `a`, that is, if it is equal to `a[l],a[l+1],...,a[r]` for some `(l,r)`.

Example 1:

```Input: nums = [4,2,4,5,6]
Output: 17
Explanation: The optimal subarray here is [2,4,5,6].
```

Example 2:

```Input: nums = [5,2,1,2,5,2,1,2,5]
Output: 8
Explanation: The optimal subarray here is [5,2,1] or [1,2,5].
```

Constraints:

• `1 <= nums.length <= 105`
• `1 <= nums[i] <= 104`

class Solution {
public:
int maximumUniqueSubarray(vector<int>& v) {
vector<int>pre(v.size()+1,0);
for(int i=0; i<v.size(); i++){
pre[i+1]=pre[i]+v[i];
}
unordered_map<int,int>m;
int ans=0;
int last=-1;
for(int i=0; i<v.size(); i++){
auto it=m.find(v[i]);
if(it!=m.end())last=max(it->second,last);
if(last!=-1)
ans=max(ans,abs(pre[i+1]-pre[last+1]));
else ans=pre[i+1];
m[v[i]]=i;
}
// for(auto it:pre)cout<<it<<" ";
// cout<<endl;
return ans;
}
};