B - Distances to Zero CodeForces - 803B

最新推荐文章于 2019-01-08 20:13:00 发布

原创最新推荐文章于 2019-01-08 20:13:00 发布 · 302 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#是怎么循环的要搞明白

水题同时被 2 个专栏收录

17 篇文章

订阅专栏

模拟

2 篇文章

订阅专栏

本文介绍了一种解决特定问题的方法：在一个整数数组中找到每个元素到最近零元素的距离。通过记录所有零的位置并计算每个元素到最近零的距离来解决这个问题。此算法能有效地处理包含至少一个零的大规模数组。

You are given the array of integer numbers a₀, a₁, ..., a_n - 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·10⁵) — length of the array a. The second line contains integer elements of the array separated by single spaces ( - 10⁹ ≤ a_i ≤ 10⁹).

Output

Print the sequence d₀, d₁, ..., d_n - 1, where d_i is the difference of indices between i and nearest j such that a_j = 0. It is possible that i = j.

Example

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

这题很好理解就是求这个数与离它最近的0的距离，

题解：不断比较离它近的0的距离，更新距离就行

#include <bits/stdc++.h>
using namespace std;
vector<int>v;
int main()
{
    int n;
    int x;
    scanf("%d",&n);
    for(int i = 0;i < n; i++) {
        scanf("%d",&x);
        if(x==0) v.push_back(i);
    }
    int k = 0;
    for(int i = 0;i < n; i++) {
        int  ans = abs(i-v[k]);//求距离
        if(k>0) {
            if(ans > 0) ans = min(ans,abs(i-v[k-1]));  // 比较和上一个零点哪个离零点小 
        }
        if(ans == 0) k++;
        if(i)
            printf(" %d",ans);
        else printf("%d",ans);
    }
    printf("\n");
return 0;
}