LongestDecreasingSubsequence on Permutation
The length of a longest decreasing subsequence.
The same fold with the comparison reversed — by Dilworth, the number of piles when the tops are kept decreasing.
Called as CombinatorialStat(x, "LongestDecreasingSubsequence"). The head's page has its examples.