제출 #928997

#제출 시각아이디문제언어결과실행 시간메모리
928997SuPythonyStone Arranging 2 (JOI23_ho_t1)C++17
100 / 100
177 ms12652 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; int main() { int n; cin>>n; map<int,int> f; vector<int> cols; for (int i=0; i<n; i++) { int c; cin>>c; cols.push_back(c); f[c]=i; } int prev=cols[0]; cout<<cols[0]<<"\n"; for (int i=1; i<n; i++) { if (i<=f[prev]) { cout<<prev<<"\n"; } else { prev=cols[i]; cout<<prev<<"\n"; } } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...