Partial Digest Problem

Given all pairwise distances between points on a line, reconstruct the positions of those points.

INPUT: The multiset of pairwise distances L, containing nCr(n,2) integers.

OUTPUT: A set X of n integers, such that ΔX=L.