Getting Started
User Guide
API Reference
Project
Defined in File MaximumSegments.h
the longest segment of sum at least t, length 0 if none, O( n )
its sum is that of its items and at least t (an audit)