Chef and Sum

CodeChefOpen on judge ↗

You are given a sequence $A_1, A_2, \ldots, A_N$. You have to find the length of a positive-sum subarray such that the sum of elements of the subarray is minimum. If there is more than one answer then print the largest possible answer. **NOTE:** If no subarray satisfies the given property than print "-1". ###Input: - The first line of the input contains a single integer $T$ denoting the num

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