Return a standard tableau of shape $(n,n)$ where $n$ is the semilength of the Dyck path.
Given a Dyck path $D$, its image is given by recording the positions of the up-steps in the first row and the positions of the down-steps in the second row.

Remove the first row of the standard tableau and insert it back using column Schensted insertion, starting with the largest number.
The algorithm for column-inserting an entry $k$ into tableau $T$ is as follows:
If $k$ is larger than all entries in the first column, place $k$ at the bottom of the first column and the procedure is finished. Otherwise, place $k$ in the first column, replacing the smallest entry, $y$, greater than $k$. Now insert $y$ into the second column using the same procedure: if $y$ is greater than all entries in the second column, place it at the bottom of that column (provided that the result is still a tableau). Otherwise, place $y$ in the second column, replacing, or 'bumping', the smallest entry, $z$, larger than $y$. Continue the procedure until we have placed a bumped entry at the bottom of a column (or on its own in a new column).

The composition corresponding to the peak set of a standard tableau.
Let $T$ be a standard tableau of size $n$.
An entry $i$ of $T$ is a descent if $i+1$ is in a lower row (in English notation), otherwise $i$ is an ascent.
An entry $2 \leq i \leq n-1$ is a peak, if $i-1$ is an ascent and $i$ is a descent.
This map returns the composition $c_1,\dots,c_k$ of $n$ such that $\{c_1, c_1+c_2,\dots, c_1+\dots+c_k\}$ is the peak set of $T$.