Submission #786065

#TimeUsernameProblemLanguageResultExecution timeMemory
786065larushStone Arranging 2 (JOI23_ho_t1)C++17
100 / 100
178 ms15232 KiB
#include <bits/stdc++.h>
#define debug(x) (cout<<'['<<(#x)<<':'<<(x)<<']'<<'\n')
using namespace std;

int main(){
    ios::sync_with_stdio(0), cin.tie(0);

    int n;
    cin>>n;
    vector<int> a(n), col(n);
    map<int,int> last;
    for(int i=0; i<n; i++){
        cin>>a[i];
        last[a[i]]=max(last[a[i]],i);
    }
    int l=0;
    while(l<n){
        int prev=a[l];
        for(; l<=last[prev]; l++){
            col[l]=prev;
        }
    }
    for(int i=0; i<n; i++) cout<<col[i]<<'\n';
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...