This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define in pair<int, int>
#define f first
#define s second
#define pb push_back
#define pob pop_back
#define INF (int)1e17
#define MX (int)3e5+5
#define fast() ios_base::sync_with_stdio(false); cin.tie(NULL)
signed main()
{
fast();
int n;
cin >> n;
vector<int> a(n+1);
map<int, int> appear;
for(int i = 1; i <= n; i++)
{
cin >> a[i];
appear[a[i]] = i;
}
for(int i = 1; i <= n; i++)
{
for(int j = i+1; j < appear[a[i]]; j++)
a[j] = a[i];
i = appear[a[i]];
}
for(int i = 1; i <= n; i++)
cout << a[i] << "\n";
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |