C1. Skyscrapers (easy version)

time limit per test1 second

memory limit per test512 megabytes

inputstandard input

outputstandard output

This is an easier version of the problem. In this version n≤1000

The outskirts of the capital are being actively built up in Berland. The company “Kernel Panic” manages the construction of a residential complex of skyscrapers in New Berlskva. All skyscrapers are built along the highway. It is known that the company has already bought n plots along the highway and is preparing to build n skyscrapers, one skyscraper per plot.

Architects must consider several requirements when planning a skyscraper. Firstly, since the land on each plot has different properties, each skyscraper has a limit on the largest number of floors it can have. Secondly, according to the design code of the city, it is unacceptable for a skyscraper to simultaneously have higher skyscrapers both to the left and to the right of it.

Formally, let’s number the plots from 1 to n. Then if the skyscraper on the i-th plot has ai floors, it must hold that ai is at most mi (1≤ai≤mi). Also there mustn’t be integers j and k such that j<iai<ak. Plots j and k are not required to be adjacent to i.

The company wants the total number of floors in the built skyscrapers to be as large as possible. Help it to choose the number of floors for each skyscraper in an optimal way, i.e. in such a way that all requirements are fulfilled, and among all such construction plans choose any plan with the maximum possible total number of floors.

Input

The first line contains a single integer n (1≤n≤1000) — the number of plots.

The second line contains the integers m1,m2,…,mn (1≤mi≤109) — the limit on the number of floors for every possible number of floors for a skyscraper on each plot.

Output

Print n integers ai — the number of floors in the plan for each skyscraper, such that all requirements are met, and the total number of floors in all skyscrapers is the maximum possible.

If there are multiple answers possible, print any of them.

Examples

inputCopy

5

1 2 3 2 1

outputCopy

1 2 3 2 1

inputCopy

3

10 6 8

outputCopy

10 6 6

Note

In the first example, you can build all skyscrapers with the highest possible height.

In the second test example, you cannot give the maximum height to all skyscrapers as this violates the design code restriction. The answer [10,6,6] is optimal. Note that the answer of [6,6,8] also satisfies all restrictions, but is not optimal.

**题意**“就是对于每个ai 不让存在aj>ai &&ak>ai j<i<k i j k可以不连续

**思路**：n只有1000 想一下 其实本质就是枚举每个点为最大值 往两边去更新 求楼的总层数

```
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define me(a,x) memset(a,x,sizeof a)
#define rep(i,x,n) for(int i=x;i<n;i++)
#define repd(i,x,n) for(int i=x;i<=n;i++)
#define all(x) (x).begin(), (x).end()
#define pb(a) push_back(a)
#define paii pair<int,int>
#define pali pair<ll,int>
#define pail pair<int,ll>
#define pall pair<ll,ll>
#define fi first
#define se second
ll a[100005];
ll b[100005];
int n;
int main()
{
cin>>n;
for(int i=1; i<=n; i++)
cin>>a[i];
ll ma=0,k=0;
for(int i=1; i<=n; i++)
{
ll sum=a[i];
b[i]=a[i];
for(int j=i-1; j; j--)
{
if(a[j]<=b[j+1])
{
sum+=a[j];
b[j]=a[j];
}
else
{
sum+=b[j+1];
b[j]=b[j+1];
}
}
for(int j=i+1; j<=n; j++)
{
if(a[j]<=b[j-1])
{
sum+=a[j];
b[j]=a[j];
}
else
{
sum+=b[j-1];
b[j]=b[j-1];
}
}
if(sum>ma)
ma=sum,k=i;
}
for(int i=k-1;i;i--){
if(a[i]>=a[i+1]){
a[i]=a[i+1];
}
}
for(int i=k+1;i<=n;i++){
if(a[i]>=a[i-1]){
a[i]=a[i-1];
}
}
for(int i=1;i<=n;i++) cout<<a[i]<<" ";
return 0;
}
```