跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F0774. Distances to Zero

    ID: 780 传统题 2000ms 256MiB 尝试: 0 已通过: 0 难度: 2 上传者: 标签>构造算法思想基础难度共享题库Codeforces英文题面题目来源题面语言

Distances to Zero

题目描述

B. Distances to Zero
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

You are given the array of integer numbers a0,a1,...,an-1. For each element find the distance to the nearest zero (to the element which equals to zero). There is at least one zero element in the given array.

Input

The first line contains integer n (1≤n≤2·105) − length of the array a. The second line contains integer elements of the array separated by single spaces (-109≤ai≤109).

Output

Print the sequence d0,d1,...,dn-1, where di is the difference of indices between i and nearest j such that aj=0. It is possible that i=j.

Examples
Input
9
2 1 0 3 0 0 3 2 4
Output
2 1 0 1 0 0 1 2 3
Input
5
0 1 2 3 4
Output
0 1 2 3 4
Input
7
5 6 0 1 -2 3 4
Output
2 1 0 1 2 3 4

题目来源：fps-www.educg.net-codeforce-1-2833.xml.zip；FPS 共享题包，题包内第 201 题。保留原作者与原赛事署名。