leetcode

0 class Solution {

1 public:

2 int maxSatisfied(const vector<int> &customers, const vector<int> &grumpy, int minutes) const {

3 const int n = size(customers);

4 int total = 0, crnt = 0, maxi = 0;

5

6 for (int i = 0; i < n; i++) {

7 (grumpy[i] ? crnt : total) += customers[i];

8 if (i >= minutes && grumpy[i - minutes]) crnt -= customers[i - minutes];

9 maxi = max(maxi, crnt);

10 }

11

12 return total + maxi;

13 }

14 };