from operator import le
from re import M
n = int(input())
arr = [int(x) for x in input().split()]
left = [float('inf')] * n
right = [float('inf')] * n
if arr[0] == 0:
left[0] = 0
for i in range(1, n):
if arr[i] == 0:
left[i] = 0
else:
left[i] = left[i-1]+1
if arr[-1] == 0:
right[-1] = 0
for i in range(n-2, -1, -1):
if arr[i] == 0:
right[i] = 0
else:
right[i] = right[i+1]+1
for i in range(n):
print(min(left[i], right[i]), end=' ')
print()
#include<bits/stdc++.h>
#define int long long
using namespace std;
int a[200005], ans[200005], n;
int32_t main(){
cin>>n;
for(int i=1;i<=n;i++){cin>>a[i];}
for(int i=1;i<=n;i++)ans[i]=INT_MAX;
for(int i=1;i<=n;i++){
if(a[i])continue;
ans[i]=0;
int d=1;
for(int j=i+1;j<=n;j++){
if(ans[j]<d)break;
if(a[j]==0)break;
ans[j]=d;
d++;
}
d=1;
for(int j=i-1;j>=1;j--){
if(a[j]==0)break;
if(ans[j]<d)break;
ans[j]=d;
d++;
}
}
for(int i=1;i<=n;i++)cout<<ans[i]<<" ";
}
1302. Deepest Leaves Sum | 1209. Remove All Adjacent Duplicates in String II |
994. Rotting Oranges | 983. Minimum Cost For Tickets |
973. K Closest Points to Origin | 969. Pancake Sorting |
967. Numbers With Same Consecutive Differences | 957. Prison Cells After N Days |
946. Validate Stack Sequences | 921. Minimum Add to Make Parentheses Valid |
881. Boats to Save People | 497. Random Point in Non-overlapping Rectangles |
528. Random Pick with Weight | 470. Implement Rand10() Using Rand7() |
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |