Championship
CodeChefOpen on judge ↗
In Programmers Army Land, people have started preparation as sports day is scheduled next week. You are given a task to form 1 team of $k$ consecutive players, from a list of sports player whose powers are given to you. You want your team to win this championship, so you have to chose your $k$ team players optimally i.e. there must not be any other $k$ consecutive team players who have their
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