-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathB.cpp
More file actions
41 lines (40 loc) · 1.08 KB
/
B.cpp
File metadata and controls
41 lines (40 loc) · 1.08 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
/*
© 2021-05-16 01:45:21 Franco1010 All Rights Reserved
*/
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
// #pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#define f first
#define s second
#define fore(i,a,b) for(int i = (a), ThxMK = (b); i < ThxMK; ++i)
#define pb push_back
#define all(s) begin(s), end(s)
#define _ ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define sz(s) int(s.size())
#define ENDL '\n'
using namespace std;
typedef long double ld;
typedef long long lli;
typedef pair<lli,lli> ii;
typedef vector<lli> vi;
#define deb(x) cout << #x": " << (x) << endl;
const lli INF = 1e18;
int main(){ _
// freopen("file.in","r",stdin);
// freopen("file.out","w",stdout);
lli n; cin >> n;
vi v(n); for(auto& i : v) cin >> i;
vi l(n, INF), r(n, INF);
lli last = -INF;
fore(i, 0, n){
if(v[i] == 0) last = i;
l[i] = min(l[i], i - last);
}
last = INF;
for(lli i = n - 1; i >= 0; i--){
if(v[i] == 0) last = i;
r[i] = min(r[i], last - i);
}
fore(i, 0, n) cout << min(l[i], r[i]) << ' '; cout << ENDL;
return 0;
}