Beautiful Garden
Chef has a beautiful garden that contains $N$ flowers. Initially, all the flowers are in full bloom. However, each flower is a bit shy – once plucked, the $i_{th}$ flower takes exactly $T_i$ days to regrow and bloom again. Chef loves plucking flowers but also wants his garden to always look beautiful. For this reason, he insists that there are always at least $K$ flowers blooming in the garden at
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.
Sign in to chat with the tutor and save your progress.
Sign in to start