Submission #1308701

#TimeUsernameProblemLanguageResultExecution timeMemory
1308701trigonStone Arranging 2 (JOI23_ho_t1)C++20
100 / 100
344 ms18056 KiB
#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
    signed n;
    cin >> n;
    vector<int> a(n);
    map<int,pair<int,int>> vals;
    for(int i=0;i<n;i++){ cin >> a[i]; if(vals.count(a[i])==0) vals[a[i]].first = i;vals[a[i]].second = i ;}
    vector<int> ans(n);
    
    for(int i=0;i<n;i++){
        int x = i;
        int c = a[i];
        i=vals[a[i]].second;
        for(int j=x;j<=i;j++){
            ans[j]=c;
        }       
    }
    for(auto &val:ans) cout<<val<<endl;
    

}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...