← All problemsSign in

Change the Signs

CodeChefRating 2107Open on judge ↗

You are given a sequence of integers $A_1, A_2, \dots, A_N$. You should choose an arbitrary (possibly empty) subsequence of $A$ and multiply each element of this subsequence by $-1$. The resulting sequence should satisfy the following condition: the sum of elements of any **contiguous** subsequence with length greater than 1 is strictly positive. You should minimise the sum of elements of the re

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

Sign in to chat with the tutor and save your progress.

Sign in to start