#line 2 "header.hpp" //%snippet.set('header')% //%snippet.fold()% #ifndef HEADER_H #define HEADER_H // template version 2.0 using namespace std; #include // varibable settings const long long INF = 1e18; template constexpr T inf = numeric_limits::max() / 2.1; #define _overload3(_1, _2, _3, name, ...) name #define _rep(i, n) repi(i, 0, n) #define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i) #define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__) #define _rrep(i, n) rrepi(i, 0, n) #define rrepi(i, a, b) for (ll i = (ll)((b)-1); i >= (ll)(a); --i) #define r_rep(...) _overload3(__VA_ARGS__, rrepi, _rrep, )(__VA_ARGS__) #define each(i, a) for (auto &&i : a) #define all(x) (x).begin(), (x).end() #define sz(x) ((int)(x).size()) #define pb(a) push_back(a) #define mp(a, b) make_pair(a, b) #define mt(...) make_tuple(__VA_ARGS__) #define ub upper_bound #define lb lower_bound #define lpos(A, x) (lower_bound(all(A), x) - A.begin()) #define upos(A, x) (upper_bound(all(A), x) - A.begin()) template inline void chmax(T &a, const T &b) { if ((a) < (b)) (a) = (b); } template inline void chmin(T &a, const T &b) { if ((a) > (b)) (a) = (b); } template auto make_table(X x, T a) { return vector(x, a); } template auto make_table(X x, Y y, Z z, Zs... zs) { auto cont = make_table(y, z, zs...); return vector(x, cont); } #define cdiv(a, b) (((a) + (b)-1) / (b)) #define is_in(x, a, b) ((a) <= (x) && (x) < (b)) #define uni(x) sort(all(x)); x.erase(unique(all(x)), x.end()) #define slice(l, r) substr(l, r - l) typedef long long ll; typedef long double ld; using vl = vector; using vvl = vector; using pll = pair; template using PQ = priority_queue, greater>; void check_input() { assert(cin.eof() == 0); int tmp; cin >> tmp; assert(cin.eof() == 1); } #if defined(PCM) || defined(LOCAL) #else #define dump(...) ; #define dump_1d(...) ; #define dump_2d(...) ; #define cerrendl ; #endif #endif /* HEADER_H */ //%snippet.end()% #line 2 "solve.cpp" template using vec = vector; struct Fast { Fast() { std::cin.tie(0); ios::sync_with_stdio(false); } } fast; // snippet:UnionFind {{{ struct UnionFind { vector par; // par[x]: parent of x. if root, -size. int gcount; // count of groups UnionFind() {} UnionFind(int _n) : par(_n, -1), gcount(_n) {} bool merge(int x, int y) { x = root(x); y = root(y); if (x != y) { if (par[y] < par[x]) swap(x, y); par[x] += par[y]; par[y] = x; gcount--; } return x != y; } int root(int x) { if (is_root(x)){ return x; } else{ return par[x] = root(par[x]); // 経路圧縮 // return root(par[x]); // 経路圧縮なし } } bool is_root(int x) { return par[x] < 0; } bool same(int x, int y) { return root(x) == root(y); } int size(int x) { return -par[root(x)]; } #if defined(PCM) || defined(LOCAL) // {{{ friend ostream& operator<<(ostream& os, UnionFind& uf) { map> group; rep(i, sz(uf.par)) { group[uf.root(i)].pb(i); } os << endl; each(g, group) { os << g << endl; } return os; } #endif // }}} }; // snippet:UnionFind }}} int solve() { ll n, a, b;cin>>n>>a>>b; dump(a, b); vector x(n); rep(i, n) { cin>>x[i]; } x.pb(-1e+9); x.pb(1e+9); sort(all(x)); dump(x); UnionFind uf(n+2); vec mostr(n+2); rep(i, 1, n+1){ ll l = lb(all(x), x[i] + a) - x.begin(); ll r = ub(all(x), x[i] + b) - x.begin(); if (l == r) continue; assert(i != 0 && i != n+1); assert(l != 0 && l != n+1); uf.merge(i, l); mostr[l] = r; } ll mr = mostr[1]; rep(i, 2, n+1){ if (mr-1 >= i) { uf.merge(i-1, i); assert(i-1 != 0 && i-1 != n+1); assert(i != 0 && i != n+1); } chmax(mr, mostr[i]); } rep(i, 1, n+1){ cout << uf.size(i) << endl; } return 0; } int main(){/*{{{*/ solve(); check_input(); return 0; }/*}}}*/