BITONIC SEGMENTS

CodeChefOpen on judge ↗

You are given an array $A$ of size $N$. You need to process $Q$ queries on the array :- Each query will be either of the following : $Type$ $1$ $:$ $1$ $l$ $r$ $:$ Output $YES$ if the sequence formed from index $l$ to index $r$ is a $Bitonic$ sequence otherwise output $NO$. $Type$ $2$ $:$ $2$ $pos$ $val$ $:$ Change value at position $pos$ to $val$ Note : A $Bitonic$ sequence is like:

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