Split Array

CodeChefOpen on judge ↗

Today Fluffy the squirrel received an array a(again). This time, he wants to split it into k parts. For each part, he calculates the sum of the elements in that part. Then, he takes the maximum among all these sums. His goal is to minimize this maximum value. For all possible k, can you determine the minimum possible maximum value Fluffy can get if he split the array into k parts optimally? Note

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