IS IT DP HARD!!

CodeChefOpen on judge ↗

Alice gives an array of $N$ elements to bob and ask to select the $smallest$ subarray which follows the following conditions: - Min{ A[l],A[l+1],.....A[r] } = Min{ A[1], A[2], ..... , A[N] } - Max{ A[l],A[l+1],.....A[r] } = Max{ A[1], A[2], ..... , A[N] } where $(l,r)$ represents subarray from index $l$ to $r$. Output the length of the subarray. ###Note: Large input file.Use $fasti

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