Beautiful Partitions

CodeChefOpen on judge ↗

Sidaga calls a sequence *beautiful* if the sum of elements of this sequence is strictly positive. Kaspers gave Sidaga a sequence $A_1, A_2, \ldots, A_N$ and asked him to partition it into exactly $K$ non-empty **contiguous** subsequences such that each element of $A$ belongs to exactly one subsequence and all $K$ subsequences are beautiful. Sidaga is getting ready for his wedding - he is busy le

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