Algorithms/1052_Grumpy_Bookstore_Owner.cpp at master · ketkimnaik/Algorithms · 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
31
32
33
class Solution {
public:
    int maxSatisfied(vector<int>& customers, vector<int>& grumpy, int X) {
        int common_sum = 0;

        for(int i = 0; i < customers.size(); ++i) {
            if(grumpy[i] == 0) {
                common_sum += customers[i];
            }
        }
        int ans = common_sum;
        int i = 0;
        for(; i < X; ++i) {
            if(grumpy[i] == 1) {
                ans += customers[i];
            }
        }

        int max_ans = ans;
        for(; i < customers.size(); ++i) {
            if(grumpy[i - X] == 1) {
                    ans -= customers[i - X];
                }
            if(grumpy[i] == 1) {
                ans += customers[i];
            }

            max_ans = max(max_ans, ans);
        }

        return max_ans;
    }
};