Good subarray

CodeChefOpen on judge ↗

Chef calls an array good if it does not contain any two adjacent identical elements. Initially, Chef has an array $A_{1}, A_{2},... A_{N}.$ He likes to change the array every now and then. You should process $Q$ queries. In each query, Chef chooses an index $x$ and changes the $xth$ element of the array to $y$. After each query, can you find the length of the longest good subarray of the curre

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