Submission #1026238

#TimeUsernameProblemLanguageResultExecution timeMemory
1026238overwatch9Stone Arranging 2 (JOI23_ho_t1)C++17
35 / 100
33 ms2752 KiB
#include <bits/stdc++.h>
using namespace std;
int main() {
    int n;
    cin >> n;
    vector <int> nums(n);
    for (int i = 0; i < n; i++)
        cin >> nums[i];
    vector <int> nxt(n);
    for (int i = 0; i < n; i++) {
        nxt[nums[i]] = i;
    }
    for (int i = 0; i < n; ) {
        int p = nxt[nums[i]];
        while (i <= p) {
            cout << nums[p] << '\n';
            i++;
        }
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...