Educational Codeforces Round 20 Distances to Zero

最新推荐文章于 2018-11-30 18:46:28 发布

古宇hhhh

最新推荐文章于 2018-11-30 18:46:28 发布

阅读量602

点赞数

CC 4.0 BY-SA版权

分类专栏： codefoce stl应用

本文链接：https://blog.youkuaiyun.com/qq_30591245/article/details/70948017

codefoce 同时被 2 个专栏收录

21 篇文章

订阅专栏

stl应用

9 篇文章

订阅专栏

本文介绍了一种算法问题，即给定一个包含至少一个零元素的整数数组，计算每个元素到最近零元素的距离。通过记录所有零的位置并计算每个元素到这些位置的最小距离来解决这个问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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 





题意：很好理解。。就是到达0 的最近的距离
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<vector>
using namespace std;
int main()
{
    int a[330003];
    int n;
    while(~scanf("%d",&n))
    {
        vector<int>v;
        for(int i=0;i<n;i++)
        {
            int m;
            scanf("%d",&m);
            if(m==0)
                v.push_back(i);
        }
        int t=0;
        for(int i=0;i<n;i++)
        {
            int x=abs(i-v[t]);
            if(t>0)
                x=min(x,abs(i-v[t-1]));
            if(x==0)
            {
                t++;
            }
            printf("%d",x);
            if(i==n-1)
                printf("\n");
            else printf(" ");
        }
    }
}