Educational Codeforces Round 20 B - Distances to Zero

没什么好说的，直接暴力两遍即可

#include<iostream>
#include<cstdio>
#include<cstring>
#include<ctime>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<set>
#include<bitset>
#include<map>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#define INF 0x3f3f3f3f
#define inf 2*0x3f3f3f3f
#define llinf 1000000000000000000
#define pi acos(-1.0)
#define mod 1000000007
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define lrt rt<<1
#define rrt rt<<1|1
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define per(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define mem(a,b) memset(a,b,sizeof(a))
#define lb(x) (x&-x)
#define gi(x) scanf("%d",&x)
#define gi2(x,y) scanf("%d%d",&x,&y)
#define gll(x) scanf("%lld",&x)
#define gll2(x,y) scanf("%lld%lld",&x,&y)
#define gc(x) scanf("%c",&x)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int>P;
/***********************************************/
int n,a[200005],zero[200005],top=1,cu=0;
int main()
{
    gi(n);zero[0]=-1;
    rep(i,0,n)
    {
        gi(a[i]);
        if(a[i]==0)zero[top++]=i;
    }
    zero[top]=n+1;
    rep(i,1,top)
    {
        rep(j,zero[i]+1,zero[i+1])a[j]=j-zero[i];
    }
    per(i,1,top)
    {
        per(j,zero[i-1]+1,zero[i])a[j]=zero[i]-j;
    }
    rep(i,1,top)
    {
        rep(j,zero[i]+1,zero[i+1])a[j]=min(a[j],j-zero[i]);
    }
    rep(i,0,n)printf("%d ",a[i]);
    return 0;
}