← All problemsSign in

Nearest Smaller Values

CSESSorting and SearchingOpen on judge ↗

Given an array of n integers, your task is to find for each array position the nearest position to its left having a smaller value. Input The first input line has an integer n: the size of the array. The second line has n integers x_1,x_2,\dots,x_n: the array values. Output Print n integers: for each array position the nearest position with a smaller value. If there is no such position, print

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