Today, the bookstore owner has a store open for customers.length minutes.  Every minute, some number of customers (customers[i]) enter the store, and all those customers leave after the end of that minute.
On some minutes, the bookstore owner is grumpy.  If the bookstore owner is grumpy on the i-th minute, grumpy[i] = 1, otherwise grumpy[i] = 0.  When the bookstore owner is grumpy, the customers of that minute are not satisfied, otherwise they are satisfied.
The bookstore owner knows a secret technique to keep themselves not grumpy for X minutes straight, but can only use it once.
Return the maximum number of customers that can be satisfied throughout the day.
Example 1:
Input: customers = [1,0,1,2,1,1,7,5], grumpy = [0,1,0,1,0,1,0,1], X = 3
Output: 16
Explanation: The bookstore owner keeps themselves not grumpy for the last 3 minutes. 
The maximum number of customers that can be satisfied = 1 + 1 + 1 + 1 + 7 + 5 = 16.
Note:
1 <= X <= customers.length == grumpy.length <= 20000
0 <= customers[i] <= 1000
0 <= grumpy[i] <= 1
class Solution:
    def maxSatisfied(self, customers: List[int], grumpy: List[int], X: int) -> int:
        max_satisfaction = sum(customers)
        actual_satisfaction = sum(int(not g) * s for g,s in zip(grumpy, customers))
        
        max_s_x = sum(customers[:X])
        actual_s_x = sum(int(not g) * s for g,s in zip(grumpy[:X], customers[:X]))
        
        ans = actual_satisfaction - actual_s_x + max_s_x
        for i in range(X, len(customers)):
            max_s_x += customers[i] - customers[i - X]
            actual_s_x += (customers[i] * int(not grumpy[i])) - (customers[i - X] * int(not grumpy[i - X]))
            ans = max(ans, actual_satisfaction - actual_s_x + max_s_x)
        return ans
class Solution:
    def maxSatisfied(self, customers: List[int], grumpy: List[int], X: int) -> int:
        max_satisfaction = sum(customers)
        actual_satisfaction = sum(int(not g) * s for g,s in zip(grumpy, customers))
        
        max_s_x = sum(customers[:X])
        actual_s_x = sum(int(not g) * s for g,s in zip(grumpy[:X], customers[:X]))
        
        ans = actual_satisfaction - actual_s_x + max_s_x
        for i in range(X, len(customers)):
            max_s_x += customers[i] - customers[i - X]
            actual_s_x += (customers[i] * int(not grumpy[i])) - (customers[i - X] * int(not grumpy[i - X]))
            ans = max(ans, actual_satisfaction - actual_s_x + max_s_x)
        return ans