제출 #1214732

#제출 시각아이디문제언어결과실행 시간메모리
1214732Hamed_GhaffariStone Arranging 2 (JOI23_ho_t1)C++20
100 / 100
235 ms13272 KiB
#include <bits/stdc++.h>
using namespace std;

using pii = pair<int, int>;

#define X first
#define Y second

const int MXN = 2e5+5;

int n;
map<int, int> cnt;
vector<pii> vec;

int32_t main() {
    cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);
    cin >> n;
    for(int i=1,a; i<=n; i++) {
        cin >> a;
        if(cnt[a]) {
            while(vec.back().Y!=a) {
                cnt[vec.back().Y]--;
                vec.pop_back();
            }
            vec.back().X = i;
        }
        else cnt[a]++, vec.push_back({i, a});
    }
    int lst=0;
    for(auto [r, c] : vec) {
        for(int i=lst+1; i<=r; i++) cout << c << '\n';
        lst = r;
    }
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...