← All problemsSign in

Partition Queries

CodeChefRating 2692Open on judge ↗

Let us define the score of an array $B$ $(B_1, B_2, B_3,...,B_k)$ as: $$ \begin{equation} score(B)=\begin{cases} \sum_{i=1}^{k}B_i, & \text{if } k \gt 1 \text{ and } Max(B) - SecondMax(B) \lt X.\\ -\sum_{i=1}^{k}B_i, & \text{otherwise}. \end{cases} \end{equation} $$ Here, $SecondMax(B)$ denotes the second element in $B$ if we sort it in non-increasing order. You are given an array $

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