Submission #1055370

#	Time	Username	Problem	Language	Result	Execution time	Memory
1055370		fryingduc	Stone Arranging 2 (JOI23_ho_t1)	C++17	0 / 100	0 ms	348 KiB

Main

#include "bits/stdc++.h"
using namespace std;

const int maxn = 2e5 + 5;
int n, a[maxn];
int mx[maxn];

void solve() {
    cin >> n;
    vector<int> v;
    for(int i = 1; i <= n; ++i) {
        cin >> a[i];
        v.push_back(a[i]);
    }
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
    for(int i = 1; i <= n; ++i) {
        a[i] = lower_bound(v.begin(), v.end(), a[i]) - v.begin() + 1;
        
        mx[a[i]] = max(mx[a[i]], i);
    }
    for(int i = 1; i <= n; ++i) { 
        int j = mx[a[i]];
        while(i < j) {
            a[i] = a[j];
            ++i;
        }
    }
    for(int i = 1; i <= n; ++i) {
        cout << a[i] << '\n';
    }
}
signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    
    solve();
    return 0;
}

• Subtask 1: 0 / 25
• Subtask 2: 0 / 35
• Subtask 3: 0 / 40