leetcode

0 class Solution {

1 public:

2 long long maximumSubarraySum(vector<int> &nums, int k) {

3 unordered_map<int, int> mp;

4 long maxi = 0, sum = 0;

5 for (int i = 0; i < nums.size(); i++) {

6 sum += nums[i];

7 mp[nums[i]]++;

8

9 if (i < k - 1) continue;

10 if (mp.size() == k) maxi = max(maxi, sum);

11 int &tmp = nums[i - k + 1];

12 sum -= tmp;

13 if (--mp[tmp] == 0) mp.erase(tmp);

14 }

15 return maxi;

16 }

17 };