# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
72171 | 신딩없는 신딩팀 (#118) | 박스런 (FXCUP3_box) | C++17 | 170 ms | 7448 KiB |
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>
using namespace std;
int N,H[500005],dp[500005];
vector<pair<int,int> >stk;
int main(){
scanf("%d",&N);
for(int i=1;i<=N;i++)
scanf("%d",H+i);
stk.push_back({0,2e9});
fill(dp,dp+N+1,2e9);
for(int i=1;i<=N;i++){
pair<int,int> cur={i,H[i]};
while(cur.second>stk.back().second)stk.pop_back();
int k=i-stk.back().first-1;
dp[k]=min(dp[k],i);
stk.push_back(cur);
}
for(int i=N-1;i;i--)
dp[i]=min(dp[i+1],dp[i]);
for(int i=1;i<=N;i++)
printf("%d ",dp[i]==2e9?-1:dp[i]-i);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |