Problem 891 · Hard

Sum of Subsequence Widths

After sorting, each element is the max of 2^i subsequences and the min of 2^(n-1-i) of them.

Open the interactive visualisation