http://www.perlmonks.org?node_id=279625


in reply to Re: Comparing 2-D co-ordinates
in thread Comparing 2-D co-ordinates

Close but no coconut

Not that I am criticising - the problem is mine for not explaing the specifications clearly enough.

A final stab at defining it: Given a set of 1-D coordinates how can I calculate the maximum coverage using discrete non-overlapping sets.

e.g. for the set (1,3),(4,6),(2-5) the mximum coverage I can find is (1,3) + (4,6).

Is that good enough or should I just stop digging?

:-)