This is Exercise 7.2(f) in Stanley "Enumerative Combinatorics II": The length of the longest chain in dominance order is
$$\frac{1}{3}m(m^2+3r-1)$$
where $n = \binom{m+1}{2} + r$ with $0 \leq r \leq m$l.