codeforces/#305 Div1/547/B Mike and Feet

最新推荐文章于 2021-06-30 17:04:26 发布

Yuer-

最新推荐文章于 2021-06-30 17:04:26 发布

阅读量740

点赞数

本文链接：https://blog.csdn.net/yuer158462008/article/details/46335137

版权

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 a_i feet high.

$\text{[math]}$

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. Thestrength 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 ≤ x ≤ n the maximum strength among all groups of size x.

Input

The first line of input contains integer n (1 ≤ n ≤ 2 × 10⁵), the number of bears.

The second line contains n integers separated by space, a₁, a₂, ..., a_n (1 ≤ a_i ≤ 10⁹), heights of bears.

Output

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

        Sample test(s) 
      
          input 
        
10
1 2 3 4 5 4 3 2 1 6

          output 
        
6 4 4 3 3 2 2 1 1 1

给n个数，连续n个数的长度为n，连续n个数里有一个最小的值，ans[n]就是所有长度为n的连续数产生的最小值中的最大的

输出ans1到ansn，即长度为1,2,3,4,5,。。。。。n的最大的值

思路：首先对每一个数a[i]，找到它一左一右第一个比他小的数。设为l,r.

可以用栈o(N)求出。

那么在长度len=r-l-1 这些数中a[i]是最小的，于是ans[len]=max（ans[len],a[i])

最后ans保证左边的比右边大，更新一下

代码：http://paste.ubuntu.com/11520736/

PS:

给n个数，l[i]表示第i个数左侧离它最近的比他小的数的位置
怎么用o（n）的方法来求数组l

stack s // initially empty
for i = 1 to n
     while s is not empty and a[s.top()] >= a[i]
          do s.pop()
     if s is empty
          then l[i] = 0
     otherwise
          l[i] = s.top()
     s.push(i)