Submission #1226627

#TimeUsernameProblemLanguageResultExecution timeMemory
1226627ffeyyaae_Stone Arranging 2 (JOI23_ho_t1)C++20
100 / 100
124 ms13384 KiB
#include <bits/stdc++.h>

using namespace std;

const int N = 2e5+5;

int n;
int a[N], b[N];
map<int,int> mp;

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n;
    for( int i=0;i<n;i++ )
    {
        cin >> a[i];
        mp[a[i]] = i;
    }
    int cur = 0;
    while( cur<n )
    {
        int last = mp[a[cur]];
        for( int i=cur;i<=last;i++ ) b[i] = a[cur];
        cur = last+1;
    }
    for( int i=0;i<n;i++ ) cout << b[i] << "\n";
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...