Account
GitHubFeedback
Drafts and results saved on this device
Submit on CSES.fi
CSES Problemset/Sorting and Searching

Nearest Smaller Values

#1645
Ask AI

Open a hint-first prompt in a new AI chat. Grok may ask you to confirm before sending.

Open Claude Desktop

Time limit:1.00 s
Memory limit:512 MB
Unsolved
Download Tests (.zip)

Given an array of nn 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 nn: the size of the array.

The second line has nn integers x1,x2,…,xnx_1,x_2,\dots,x_n: the array values.

Output

Print nn integers: for each array position the nearest position with a smaller value. If there is no such position, print 00.

Constraints
  • 1≤n≤2⋅1051 \le n \le 2 \cdot 10^5
  • 1≤xi≤1091 \le x_i \le 10^9
Sample Test Cases (1)
Example 1ID: sample-1
Input
8
2 5 1 4 8 3 2 5
Expected Output
0 1 0 3 4 3 3 7
Tools
1
2
3
4
5
6
7
8
9
10
11
12
Draft saved locally
|1 line, 0 chars
Test Bench
Download .zip
Input (stdin)
8
2 5 1 4 8 3 2 5
Expected Output
0 1 0 3 4 3 3 7