제출 #995107

#제출 시각아이디문제언어결과실행 시간메모리
995107mnieplowiczStone Arranging 2 (JOI23_ho_t1)C++14
100 / 100
138 ms14460 KiB
#include <bits/stdc++.h> using namespace std; int tab[200005]; map <int, int> ost; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; for(int i = 0; i < n; i++){ cin >> tab[i]; ost[tab[i]] = i; } //for(int i = 0; i < 10; i++) cerr << ost[i] << '\n'; int pom = 0; while(pom < n){ int kon = ost[tab[pom]]; for(int i = pom; i < kon; i++) tab[i] = tab[pom]; pom = kon + 1; //cerr << pom << " "; } for(int i = 0; i < n; i++) cout << tab[i] << '\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...