제출 #951485

#제출 시각아이디문제언어결과실행 시간메모리
951485Trisanu_DasEditor (BOI15_edi)C++17
0 / 100
38 ms5104 KiB
#include <bits/stdc++.h> #pragma GCC optimize ("O2,unroll-loops") using namespace std; const int MAXN = 300010, LOG=18; int n, x, ans[MAXN], par[MAXN], mn[MAXN]; int main(){ ios_base::sync_with_stdio(false); cin.tie(0); cin >> n; for (int i = 1; i <= n; i++){ cin >> x; if (x){ par[i] = i; ans[i] = x; }else{ mn[i]=x=-x; int v = i - 1; while (mn[v] >= x) v = par[v]; par[i] = v - 1; ans[i] = ans[par[i]]; } cout << ans[i] << '\n'; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...