# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1149074 | blackslex | Stone Arranging 2 (JOI23_ho_t1) | C++20 | 245 ms | 12468 KiB |
#include<bits/stdc++.h>
using namespace std;
int n;
int main() {
scanf("%d", &n);
vector<int> a(n);
map<int, int> nxt;
map<int, vector<int>> mp;
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
nxt[a[i]] = i;
}
int mn = -1;
for (int i = 0; i < n; i++) {
if (mn >= i) continue;
for (int j = i; j <= nxt[a[i]]; j++) a[j] = a[i];
mn = nxt[a[i]];
}
for (auto &e: a) printf("%d\n", e);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |