Mike and Feet - CodeForces #547 B

Mike and Feet

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

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 strengthof 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 × 105), the number of bears.

The second line contains n integers separated by space, a1, a2, ..., an (1 ≤ ai ≤ 109), 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 

题意：对于每一个序列是权值是它里面最小的那个数。找到长度为1-n的序列的最大权值。

思路：对于每一个点，可以求出它两边大于等于它的值的最远扩展长度len。然后1-len的值就可以为这个点的权值。将上述统计结果排序，然后就可以求出所有的答案。

AC代码如下：

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
struct node
{
    int len,num;
}arr[200010];
int T,t,n,m;
int l[200010],r[200010];
int val[200010],ans[200010];
bool cmp(node a,node b)
{
    return a.num>b.num;
}
int main()
{
    int i,j,k,len;
    scanf("%d",&n);
    for(i=1;i<=n;i++)
    {
        scanf("%d",&val[i]);
        l[i]=r[i]=i;
    }
    for(i=1;i<=n;i++)
       while(val[l[i]-1]>=val[i])
         l[i]=l[l[i]-1];
    for(i=n;i>=1;i--)
       while(val[r[i]+1]>=val[i])
         r[i]=r[r[i]+1];
    for(i=1;i<=n;i++)
    {
        arr[i].len=r[i]-l[i]+1;
        arr[i].num=val[i];
    }
    sort(arr+1,arr+1+n,cmp);
    ans[0]=1e9+7;
    for(i=1;i<=n;i++)
    {
        len=arr[i].len;
        while(ans[len]<arr[i].num)
        {
            ans[len]=arr[i].num;
            len--;
        }
    }
    for(i=1;i<=n;i++)
       printf("%d ",ans[i]);
    printf("\n");
}