#include const double pi = 3.141592653589793238462643383279; using namespace std; //typedef //------------------------------------------ typedef vector VI; typedef vector VVI; typedef vector VS; typedef pair PII; typedef pair PLL; typedef pair TIII; typedef long long LL; typedef unsigned long long ULL; typedef vector VLL; typedef vector VVLL; //container util //------------------------------------------ #define ALL(a) (a).begin(),(a).end() #define RALL(a) (a).rbegin(), (a).rend() #define PB push_back #define MP make_pair #define SZ(a) int((a).size()) #define SQ(a) ((a)*(a)) #define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i) #define EXIST(s,e) ((s).find(e)!=(s).end()) #define SORT(c) sort((c).begin(),(c).end()) //repetition //------------------------------------------ #define FOR(i,s,n) for(int i=s;i<(int)n;++i) #define REP(i,n) FOR(i,0,n) #define MOD 1000000007 #define rep(i, a, b) for(int i = a; i < (b); ++i) #define trav(a, x) for(auto& a : x) #define all(x) x.begin(), x.end() #define sz(x) (int)(x).size() typedef long long ll; typedef pair pii; typedef vector vi; #define chmin(x,y) x=min(x,y) #define chmax(x,y) x=max(x,y) #define EPS 1e-10 //ここから編集 int N, A, B; bool visited[200010]; vector x; int group[200010]; map mp; vector ababa; int ans[200010]; int cnt = 0; void dfs(int v, int p, int k){ group[v] = k; cnt++; visited[v] = true; { auto itr = upper_bound(all(x), x[v]+A-1); if(itr != x.end()) { int idx = mp[*itr]; while(idx < N && x[idx] - x[v] >= A && x[idx] - x[v] <= B ){ if(visited[idx]) { idx++; continue; } dfs(idx, v, k); idx++; } } } { auto itr = upper_bound(all(x), x[v]-B-1); int idx = mp[*itr]; while(idx < N && x[v] - x[idx] >= A && x[v] - x[idx] <= B ){ if(visited[idx]) { idx++; continue; } dfs(idx, v, k); idx++; } } } int main() { cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(6); cin >> N >> A >> B; x.resize(N); REP(i,N) cin >> x[i], mp[x[i]] = i; int k = 0; for(int i=0; i