Submission #774753

#TimeUsernameProblemLanguageResultExecution timeMemory
774753ngungunguStone Arranging 2 (JOI23_ho_t1)C++17
100 / 100
375 ms12424 KiB
#include<bits/stdc++.h> using namespace std; const int maxn = 2e5 + 5; map<int,int> d; int main() { int n; cin >> n; map<int,int> d; int a[maxn]; for(int i = 1;i <= n;i++) { cin >> a[i]; d[a[i]] = i; } int check; for(int i = 1; i <= n;i++) { check = d[a[i]]; for(int j = 1; j <= check - i + 1; j++){ cout << a[i] << endl; } i = check; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...