Smoothly Increasing
An array $B$ of length $M$ is said to be *smoothly increasing* if it satisfies either of the following conditions: - $M = 1$, or - $B_1 \lt B_2 \lt \cdots \lt B_M$, and the difference array $[B_2 - B_1, B_3 - B_2, \ldots, B_M - B_{M-1}]$ is *smoothly increasing*. That is, an array is smoothly increasing if it either has length $1$, or it is strictly increasing and its difference array is smoothly
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.
Sign in to chat with the tutor and save your progress.
Sign in to start