MyLeetcode/cpp_solutions/2461.cpp at main · Kaminyou/MyLeetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
class Solution {
public:
    long long maximumSubarraySum(vector<int>& nums, int k) {
        long long res = 0;
        long long sum = 0;
        unordered_map<int, int> mp;
        int n = nums.size();
        int unique = 0;
        for (int i = 0; i < k; ++i) {
            sum += nums[i];
            mp[nums[i]]++;
            if (mp[nums[i]] == 1) unique++;
        }

        if (unique == k) res = max(res, sum);

        for (int i = k; i < n; ++i) {
            sum += nums[i];
            mp[nums[i]]++;
            if (mp[nums[i]] == 1) unique++;

            sum -= nums[i - k];
            mp[nums[i - k]]--;
            if (mp[nums[i - k]] == 0) unique--;

            if (unique == k) res = max(res, sum);
        }
        return res;
    }
};