Problem
Suppose we are given a set L of n line segments in the plane where each segment has one endpoint on the line y = 0 and one endpoint on the line y = 1, and all 2n endpoints are distinct. Use dynamic programming to compute the largest subset of L in which no pair of segments intersect.