[guided]Let $(\Omega,\mathcal F,\mathbb P)$ be the probability space carrying the random variables $Y_1,\dots,Y_n$. Let $S_n$ denote the symmetric group, meaning the set of all permutations of $\{1,\dots,n\}$.
The statistic $W_{n,+}$ first orders the observations by absolute value and then adds the ranks whose original observations are positive. Thus the ranks are the deterministic list $1,\dots,n$ after ordering, while the remaining randomness is whether the observation carrying rank $k$ has positive sign.
For each $i\in\{1,\dots,n\}$, define the sign selector $S_i:\Omega\to\{0,1\}$ by
\begin{align*}
S_i(\omega)=\mathbb{1}_{(0,\infty)}(Y_i(\omega)).
\end{align*}
Because $Y_i$ has a continuous distribution, $\mathbb P(Y_i=0)=0$. Because the distribution is symmetric about $0$, the two events $\{Y_i>0\}$ and $\{Y_i<0\}$ have equal probability. Hence
\begin{align*}
\mathbb P(S_i=1)=\mathbb P(Y_i>0)=\frac12.
\end{align*}
The random variables $Y_1,\dots,Y_n$ are independent, so the sign selectors $S_1,\dots,S_n$ are independent.
We also need the signs to be independent of the absolute ranks. Fix $i\in\{1,\dots,n\}$ and let $A\subset[0,\infty)$ be a Borel set. Symmetry of the law of $Y_i$ gives the same probability to $A\cap(0,\infty)$ and to $-A\cap(-\infty,0)$, while continuity gives no atom at $0$. Therefore
\begin{align*}
\mathbb P(Y_i>0, |Y_i|\in A)=\mathbb P(Y_i\in A\cap(0,\infty))=\frac12\mathbb P(|Y_i|\in A).
\end{align*}
This proves that $S_i$ is independent of $|Y_i|$. Since independence across $i$ makes the pairs determined by different $Y_i$ independent, we verify the resulting vector independence on rectangles. Choose arbitrary values $s_i\in\{0,1\}$ and Borel sets $A_i\subset[0,\infty)$. Independence of the pairs $(S_i,|Y_i|)$ gives
\begin{align*}
\mathbb P(S_i=s_i, |Y_i|\in A_i \text{ for all } i)=\prod_{i=1}^n\mathbb P(S_i=s_i, |Y_i|\in A_i).
\end{align*}
For each factor, the coordinatewise independence already proved gives
\begin{align*}
\mathbb P(S_i=s_i, |Y_i|\in A_i)=\mathbb P(S_i=s_i)\mathbb P(|Y_i|\in A_i).
\end{align*}
Multiplying these identities yields the product of the probability of the sign rectangle and the probability of the absolute-value rectangle. Since rectangles generate the product Borel $\sigma$-algebras, the full sign vector $(S_1,\dots,S_n)$ is independent of the absolute-value vector $(|Y_1|,\dots,|Y_n|)$.
Now define $\pi:\Omega\to S_n$ to be the random permutation that arranges the absolute values in increasing order:
\begin{align*}
|Y_{\pi(1)}|<|Y_{\pi(2)}|<\dots<|Y_{\pi(n)}|.
\end{align*}
The ordering is defined almost surely because pairwise ties have probability $0$. To see this, fix $i\neq j$. The random variable $|Y_i|$ is non-atomic: for any $a\geq0$, continuity of the law of $Y_i$ gives $\mathbb P(|Y_i|=a)=0$. Since $|Y_i|$ and $|Y_j|$ are independent,
\begin{align*}
\mathbb P(|Y_i|=|Y_j|)=\mathbb E\big[\mathbb P(|Y_i|=|Y_j|\mid |Y_j|)\big]=0.
\end{align*}
There are only finitely many pairs $(i,j)$ with $i\neq j$, so the probability of at least one absolute-value tie is $0$. Since $\pi$ is determined by $(|Y_1|,\dots,|Y_n|)$, the independence just proved implies that $(S_1,\dots,S_n)$ is independent of $\pi$.
With this notation, the observation carrying absolute rank $k$ is $Y_{\pi(k)}$, and it contributes $k$ precisely when $Y_{\pi(k)}>0$. Hence
\begin{align*}
W_{n,+}(Y_1,\dots,Y_n)=\sum_{k=1}^n k\,S_{\pi(k)}
\end{align*}
almost surely. Since $\pi$ is independent of the signs and the signs are independent fair Bernoulli variables, the permuted vector $(S_{\pi(1)},\dots,S_{\pi(n)})$ has the same distribution as a vector $(B_1,\dots,B_n)$ of independent $\operatorname{Ber}(1/2)$ variables. Consequently
\begin{align*}
W_{n,+}(Y_1,\dots,Y_n)\stackrel{d}{=}\sum_{k=1}^n kB_k.
\end{align*}[/guided]