Before revision:  Achieving this running time requires proving several structural properties of the LMAPs. As an additional result , we prove that the LMAPs interleave each other , thus we bound the number of LMAPs to be O(n).
After revision:  In addition , we prove that the LMAPs interleave each other , thus we bound the number of LMAPs to be O(n).