The reverse of a perfect matching of $\{1,2,...,n\}$.
This is the perfect matching obtained by replacing $i$ by $n+1-i$.

The fixed-point-free permutation with deficiencies given by the perfect matching, no alignments and no inversions between exceedences.
Put differently, the exceedences form the unique non-nesting perfect matching whose openers coincide with those of the given perfect matching.

The Lewis-Lyu-Pylyavskyy-Sen shape of a permutation.
An ascent in a sequence $u = (u_1, u_2, \ldots)$ is an index $i$ such that $u_i < u_{i+1}$. Let $\mathrm{asc}(u)$ denote the number of ascents of $u$, and let
$$\mathrm{asc}^{*}(u) := \begin{cases} 0 &\textrm{if u is empty}, \\ 1 + \mathrm{asc}(u) &\textrm{otherwise}.\end{cases}$$
Given a permutation $w$ in the symmetric group $\mathfrak{S}_n$, define
$A'_k := \max_{u_1, \ldots, u_k} (\mathrm{asc}^{*}(u_1) + \cdots + \mathrm{asc}^{*}(u_k))$
where the maximum is taken over disjoint subsequences ${u_i}$ of $w$.
Then $A'_1, A'_2-A'_1, A'_3-A'_2,\dots$ is a partition of $n$. Its conjugate is the Lewis-Lyu-Pylyavskyy-Sen shape of a permutation.