// for Luogu

#include <cstdio>
#include <vector>
const int N = 200005;
int n, ans[N], x;
struct twt {
	int sum, pre, suf;
	twt(int x = 0, int y = 0, int z = 0) { sum = x, pre = y, suf = z; }
	friend twt operator + (twt a, twt b) {
		return twt(a.sum + b.sum, std::max(a.pre, b.pre + a.sum), std::max(b.suf, a.suf + b.sum));
	}
} t[N<<2];
std::vector<int> pos[N];
void Update(int p, int l, int r, int x, int y) {
	if(l == r) {
		t[p].pre = std::max(0, y), t[p].suf = std::max(0, y);
		t[p].sum = y;
		return;
	}
	int mid = l + (r-l) / 2;
	if(x <= mid) Update(p+p, l, mid, x, y);
	else Update(p+p+1, mid+1, r, x, y);
	t[p] = t[p+p] + t[p+p+1];
}
twt Query(int p, int l, int r, int x, int y) {
	if(x > y) return twt(0, 0, 0);
	if(l == x && r == y) return t[p];
	int mid = l + (r-l) / 2;
	if(y <= mid) return Query(p+p, l, mid, x, y);
	else if(x > mid) return Query(p+p+1, mid+1, r, x, y);
	else return Query(p+p, l, mid, x, mid) + Query(p+p+1, mid+1, r, mid+1, y);
}
void solve1() {
	for(int i = 1; i <= n; i++) Update(1, 1, n, i, 1);
	for(int i = 1; i <= n; i++) {
		for(int j = 0; j < (signed)pos[i].size(); j++) {
			int v = pos[i][j];
			int an = Query(1, 1, n, 1, v-1).suf + 1 + Query(1, 1, n, v+1, n).pre;
			ans[v] = std::max(ans[v], an/2);
		}
		for(int j = 0; j < (signed)pos[i].size(); j++) Update(1, 1, n, pos[i][j], -1);
	}
}
void solve2() {
	for(int i = 1; i <= n; i++) Update(1, 1, n, i, 1);
	for(int i = n; i >= 1; i--) {
		for(int j = 0; j < (signed)pos[i].size(); j++) {
			int v = pos[i][j];
			int an = Query(1, 1, n, 1, v-1).suf + 1 + Query(1, 1, n, v+1, n).pre;
			ans[v] = std::max(ans[v], (an-1)/2);
		}
		for(int j = 0; j < (signed)pos[i].size(); j++) Update(1, 1, n, pos[i][j], -1);
	}
}
int main() {
	scanf("%d", &n);
	for(int i = 1; i <= n; i++) scanf("%d", &x), pos[x].push_back(i);
	solve1(), solve2();
	for(int i = 1; i <= n; i++) printf("%d ", ans[i]);
	return 0;
}