# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
72170 | ㅋ (#118) | Box Run (FXCUP3_box) | C++17 | 197 ms | 9088 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<stdio.h>
int top,arr[500010],n,a[500010],st[500010],c,dap[500010];
int main()
{
int i,j;
//freopen("input.txt","r",stdin);
scanf("%d",&n);
for(i=1;i<=n;i++) scanf("%d",&a[i]);
for(i=1;i<=n;i++)
{
while(top)
{
if(a[st[top]]>=a[i]) break;
top--;
}
arr[i-1]=i-st[top]-1;
st[++top]=i;
}
c=1;
for(i=1;i<=n-1;i++)
{
if(c>arr[i]) continue;
for(j=c;j<=arr[i];j++)
{
dap[j]=i-j+1;
}
c=arr[i]+1;
}
for(i=1;i<=n;i++)
{
if(dap[i]==0) printf(" -1");
else printf("%d ",dap[i]);
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |