Nova and Subsequence

CodeChefOpen on judge ↗

Nova had a [sequence](https://en.wikipedia.org/wiki/Subsequence) of $n$ positive and negative integers $a$1, $a$2, $a$3,...., $a$n and he was assigned a specific task. He noticed the alternating pattern of positive and negative values that appeared throughout the sequence (The sequence has no zeros). His task is to find the longest possible alternating subsequence and this subsequence should have

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