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 ll long long
#define ar array
#define ld long double
const int N = 2000, MOD = 1e9 + 7, INF = 1e17;
signed main(){ios::sync_with_stdio(false);cin.tie(0);
int n;
cin>>n;
int A[n];
map<int,int> lst;
for(int i = 0;i<n;i++){
cin>>A[i];
lst[A[i]] = i;
}
for(int i = 0;i + 1 < n;i++){
if(lst[A[i]] > i){
A[i+1] = A[i];
}
}
for(int i = 0;i<n;i++)cout<<A[i]<<'\n';
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |