Save Sattu

CodeChefOpen on judge ↗

Sattu's friend Priya is angry with him as he didn't help her in the previous Spider Contest. This time Sattu wants to do this question for her, so that she forgives him. You are given an array $A$ of numbers from $1$ to $N$, that is , the array has $N$ distinct numbers from $1$ to $N$ and two numbers $p$ and $q$. Your task is to determine subsequences such that for any 2 numbers, $X$ and $Y$

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