Suffix Minima

Difficulty: 900 3500 ms 128 MB

implementation

For every position print the minimum of a_i..N.

Input: the first line has N; the second line has N integers.

Output: N integers: the minimum from each position to the end.

Constraints:

• 1 ≤ N ≤ 10⁵
• -10000 ≤ a_i ≤ 10000

Sample Tests

4
2 1 5 3

1 1 3 3

1
9

9

Read the Editorial