Chef and Chefu

CodeChefOpen on judge ↗

Chef and his friend Chefu are playing a game. They have a sequence of integers $A$ of size $N$. In each move a player chooses a subsequence such that the size of the subsequence is maximum and every element in the subsequence is similar to its adjacent elements. Total points scored by a player in each move is equal to sum of all the integers in the subsequence chosen by him. After a subsequence

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