#include <bits/stdc++.h>
using namespace std;
const int N = 2 * 1e5 + 100;
int n, a[N];
unordered_map<int, int> last;
int main(){
cin >> n;
for (int i = 1; i <= n; ++i){
cin >> a[i]; last[a[i]] = i;
}
int x = 1;
while (x <= n){
int y = last[a[x]] + 1;
for (int i = x; i < y; ++i)
cout << a[x] << '\n';
x = y;
}
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... |