# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
72222 | 김동현보다 잘함 (#118) | Box Run (FXCUP3_box) | C++17 | 176 ms | 7344 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;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
int n;
int INF = 1e9;
int arr[500100];
int ans[500100];
int main() {
int i;
scanf("%d",&n);
for (i=0;i<=n;i++) ans[i] = INF;
stack<int> st;
st.push(0);
arr[0] = 1e9+10;
for (i=1;i<=n;i++) {
scanf("%d",&arr[i]);
while(arr[st.top()]<arr[i]) st.pop();
ans[i-st.top()-1] = min(ans[i-st.top()-1],i);
st.push(i);
}
for (i=n-1;i>=0;i--) ans[i] = min(ans[i],ans[i+1]);
for (i=1;i<=n;i++) printf("%d ",ans[i]>n?-1:ans[i]-i);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |