Educational Codeforces Round 20 b 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
Copy
9
2 1 0 3 0 0 3 2 4
Output
Copy
2 1 0 1 0 0 1 2 3 
Input
Copy
5
0 1 2 3 4
Output
Copy
0 1 2 3 4 
Input
Copy
7
5 6 0 1 -2 3 4
Output
Copy
2 1 0 1 2 3 4 

题面大意:给你一个数字序列,然后让你计算,每个数字下标到最近的0的下标最小的距离

思路:从前向后扫描,如果本数字不为0,而且前面也没有0,那就继续扫描,如果前面有0,那就更新本节点信息,节点信息表示距离最近的0的距离。如果本数字为0,计录下标同时向前更新节点的信息,知道遇到前一个0或者数组开头为止

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#define ll long long
using namespace std;
const int inf=0x3f3f3f3f;
const int N =2e5+5;
ll g[N];
int sign[N];
int ans[N];
int main()
{
    int n;
    cin>>n;
    int cnt=0;
    for(int i=1;i<=n;i++ )
    {
        cin>>g[i];
        if(g[i]==0)
        {
            sign[cnt++]=i;
            if(cnt==1)
            {
                for(int j=1;j<=sign[cnt-1];j++)
                {
                    ans[j]=sign[cnt-1]-j;
                }
            }
            else
            {
                for(int j=sign[cnt-2]+1;j<=sign[cnt-1];j++)
                {
                    ans[j]=min(ans[j],sign[cnt-1]-j);
                }
            }
        }
        else
        {
            if(cnt>0)
            {
               ans[i]=i-sign[cnt-1];
            }
        }
    }
    for(int i=1;i<=n;i++)
        cout<<ans[i]<<' ';
    cout<<endl;
    return 0;
}



阅读更多
文章标签: 贪心
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

不良信息举报

Educational Codeforces Round 20 b Distances to Zero

最多只允许输入30个字

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭