CAU2 HSGHN L9 2015-2016

#define task "CAU2"

#include <iostream>
#include <cstdio>

using namespace std;

using ll = long long;
using ld = long double;

constexpr int N = 3e4 + 5;
constexpr int Inf = 1e9 + 7;

int n, a[N], b[N];

void Read()
{
    cin >> n;

    for (int i = 1; i <= n; ++i)
        cin >> a[i];
}

void Solve()
{
    b[0] = -Inf;
    for (int i = 1; i <= n; ++i)
        b[i] = max(b[i - 1], a[i]);

    for (int i = 1; i <= n; ++i)
        cout << b[i] << " ";
}

int32_t main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    if (fopen(task ".INP", "r"))
    {
        freopen(task ".INP", "r", stdin);
        freopen(task ".OUT", "w", stdout);
    }

    Read();
    Solve();
}