Maximising Vacations

CodeChefRating 2147Open on judge ↗

You are given Chef's calendar for the next $N$ days, defined as a binary string $S$ of length $N$ where $S_i = 0$ means that Chef has a holiday on the $i^{th}$ day from now, and $S_i = 1$ means that Chef has to work on that day. Chef wants to plan his vacations. For each vacation, Chef needs $X$ consecutive holidays in his calendar. Obviously, he can only go on one vacation at a time. Chef can

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI