2796.Mike and Feet

Time Limit: 1s Memory Limit: 256MB

Mike is the president of country What-The-Fatherland. There are n bears living in this country besides Mike. All of them are standing in a line and they are numbered from 1 to n from left to right. i-th bear is exactly ai feet high.

2796_1.png

A group of bears is a non-empty contiguous segment of the line. The size of a group is the number of bears in that group. The strength of a group is the minimum height of the bear in that group.

Mike is a curious to know for each x such that 1 \le x \le n the maximum strength among all groups of size x.

Input Format(From the terminal/stdin)

The first line of input contains integer n (1 \le n \le 2 \times 105), the number of bears.

The second line contains n integers separated by space, a1,a2,...,an (1 \le ai \le 109), heights of bears.

Output Format(To the terminal/stdout)

Print n integers in one line. For each x from 1 to n, print the maximum strength among all groups of size x.

Sample Input

Copy
10
1 2 3 4 5 4 3 2 1 6
  \n
 · · · · · · · · · \n

Sample Output

Copy
6 4 4 3 3 2 2 1 1 1 
 · · · · · · · · · \n

Submit

请先 登录

© 2025 FAQs