Jethalal and Babita
CodeChefOpen on judge ↗
Jethalal's favourite numbers are $n$ and 1, and Babita's favourite numbers are $m$ and −1. One day Jethalal and Babita met and wrote down every possible array of length $n+m$ such that some $n$ of its elements are equal to 1 and another $m$ elements are equal to −1. For each such array they counted its maximal prefix sum, probably an empty one which is equal to 0 (in another words, if every nonemp
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