[CF803B] Distances to Zero（模拟）

题目链接：http://codeforces.com/contest/803/problem/B

题意：给n个数，问每个数和最近的0的位置的最短距离。

正着来一遍，倒着来一遍。

#include <bits/stdc++.h>
using namespace std;

const int maxn = 200200;
int a[maxn];
int dp[maxn];
int n;

int main() {
    // freopen("in", "r", stdin);
    while(~scanf("%d", &n)) {
        memset(dp, 0x7f, sizeof(dp));
        for(int i = 1; i <= n; i++) {
            scanf("%d", &a[i]);
        }
        int cnt;
        int i = 1;
        while(a[i] != 0) i++;
        cnt = i;
        for(; i <= n; i++) {
            if(a[i] == 0) {
                dp[i] = 0;
                cnt = i;
            }
            else dp[i] = min(dp[i], abs(cnt-i));
        }
        i = n;
        while(a[i] != 0) i--;
        cnt = i;
        for(; i >= 1; i--) {
            if(a[i] == 0) cnt = i;
            else dp[i] = min(dp[i], abs(cnt-i));
        }
        for(int i = 1; i <= n; i++) printf("%d ", dp[i]);
        printf("
");
    }
    return 0;
}