← All problemsSign in

Chef Lost an Array

CodeChefRating 2613Open on judge ↗

In $1971$, Chef and his wife created a beautiful array $A$ of $N$ integers: $A_1, A_2, \ldots, A_N$. The absolute difference between any two adjacent elements of the array was at most $D$. When he read about **Prefix Max** and **Prefix Min** in $2000$, Chef made two more arrays $B$ and $C$ of $N$ integers where, for $i$ ranging from $1$ to $N$, - $B_i = max(A_1,.....A_i)$ - $C_i = min(A_1,.....A_

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

Sign in to chat with the tutor and save your progress.

Sign in to start