#include using namespace std; #define int ll #define ll long long #define I32_MAX 2147483647 #define I64_MAX 9223372036854775807LL #define I64_MAX2 1223372036854775807LL #define INF I64_MAX2 #define MOD 1000000007 // #define MOD 998244353 #define MEM_SIZE 100010 #define DEBUG_OUT true #define ALL(x) (x).begin(), (x).end() template void DEBUG(T e){if(DEBUG_OUT == false)return; std::cout << e <<" ";} template void DEBUG(const std::vector& v){if(DEBUG_OUT == false)return;for(const auto& e : v){std::cout<< e << " "; } std::cout << std::endl;} template void DEBUG(const std::vector >& vv){if(DEBUG_OUT == false)return;for(const auto& v : vv){ DEBUG(v); } } template void DEBUG(T d, Ts... e){if(DEBUG_OUT == false)return;DEBUG(d);DEBUG(e...);} template void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; abort();}} template< typename T1, typename T2 > inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); } template< typename T1, typename T2 > inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); } struct UnionFind { vector< int > data; UnionFind(int sz) { data.assign(sz, -1); } bool unite(int x, int y) { x = find(x), y = find(y); if(x == y) return (false); if(data[x] > data[y]) swap(x, y); data[x] += data[y]; data[y] = x; return (true); } int find(int k) { if(data[k] < 0) return (k); return (data[k] = find(data[k])); } int size(int k) { return (-data[find(k)]); } }; //その2 void solve(void) { int n,a,b; cin>>n>>a>>b; vector vec (n,0); for (int i = 0; i < n; i++) { cin>>vec[i]; } UnionFind uf(n); for (int i = 0; i < n ;i++) { // l <= x < rの半開区間 int l = distance(vec.begin(),lower_bound(ALL(vec),vec[i] + a)); int r = distance(vec.begin(),upper_bound(ALL(vec),vec[i] + b)); for (int j = l; j < r; j++) { uf.unite(i,j); } } return; for (int i = 0; i < n; i++) { cout<