Implement `maximum_schedule_earnings(schedule, k, daily_pay, consecutive_bonus)`. `schedule[i]` is `1` for an existing workday and `0` for a day off. Every workday earns `daily_pay`. A workday also earns `consecutive_bonus` when the previous calendar day is a workday. You may change at most `k` days off into workdays. Return the maximum total earnings over the entire schedule. ### Constraints - `1 <= len(schedule) <= 200000` - `schedule[i]` is `0` or `1`. - `0 <= k <= len(schedule)` - `0 <= daily_pay, consecutive_bonus <= 10^9` - Return a 64-bit integer. ### Examples - `[1, 0, 1]`, `k = 1`, `daily_pay = 10`, `consecutive_bonus = 5` returns `40` after changing the middle day: three daily payments and two bonuses. - `[0, 0]`, `k = 1`, `daily_pay = 7`, `consecutive_bonus = 3` returns `7`. ```hint The value of a changed day depends on its neighbors Joining two work blocks can create two bonuses, while extending one block creates one. ``` ```hint Formulate a small-state dynamic program Process days left to right while tracking changes used and whether the previous day is worked; then look for how to exploit the structure without an `O(nk)` table. ```