Submission #1145522

#TimeUsernameProblemLanguageResultExecution timeMemory
1145522ezzzayStone Arranging 2 (JOI23_ho_t1)C++20
25 / 100
2095 ms2260 KiB
#include<bits/stdc++.h> using namespace std; #define int long long #define ff first #define ss second #define pb puhs_back const int N=3e5+5; int a[N]; signed main(){ int n; cin>>n; for(int i=1;i<=n;i++)cin>>a[i]; for(int i=1;i<=n;i++){ int j=i; while(a[j-1]!=a[i] and j-1>=0)j--; j--; if(j!=-1){ while(j<i){ a[j]=a[i]; j++; } } } for(int i=1;i<=n;i++)cout<<a[i]<<endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...