제출 #774745

#제출 시각아이디문제언어결과실행 시간메모리
774745vjudge1Stone Arranging 2 (JOI23_ho_t1)C++14
100 / 100
84 ms12088 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long #define fi first #define se second #define ii pair<int,int> const ll maxn=2e5+2; int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin>>n; int a[n+1]; unordered_map <int,int> mp; for (int i=1;i<=n;++i){ cin>>a[i]; mp[a[i]]=i; } int ptr=1; while(ptr<=n){ int p=mp[a[ptr]]; for (int i=ptr;i<=p;++i){ a[i]=a[ptr]; } ptr=p+1; } for (int i=1;i<=n;++i){ cout<<a[i]<<" "; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...