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[LOG][MAXN], mn[MAXN][LOG];
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>0){
for (int j=0; j<LOG; j++) par[i][j]=i;
ans[i]=x;
}
else{
mn[i][0]=x=-x;
int v=i-1;
for (int j=LOG-1; j>=0; j--) if (mn[v][j]>=(-x)) v=par[v][j];
par[i][0]=v-1;
for (int j=1; j<LOG; j++){
par[i][j]=par[par[i][j-1]][j-1];
mn[i][j]=min(mn[i][j-1], mn[par[i][j-1]][j-1]);
}
ans[i]=ans[par[i][0]];
}
cout<<ans[i]<<'\n';
}
return 0;
}
# | 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... |