- We have an ordered list (P[]) of XYZ points (N = around 10 000 points)
- We need to find the seven points (A-G, in order) of that list that have the largest total XY distance between them (AB + BC + ... + FG)
- The Z distance between A and G must be below 1000 (A.Z < G.Z + 1000)
see https://www.onlinecontest.org/olc-3.0/segelflugszene/cms.html?url=rules_overview/b2_en (Section 4.3.1)