This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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);cout.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 time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |