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>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
//#define int long long
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
signed main() {
int n;
cin >> n;
vector<int> v(n);
for(int &x : v) cin >> x;
for(int i=1; i<n; i++) {
int p = i;
for(int j=i-1; j>=0; j--) {
if(v[i] == v[j]) {
p = j;
break;
}
}
for(int j=p; j<i; j++) v[j] = v[i];
}
for(int &x : v) cout << x << '\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... |