The maximal segment sum revisited

The maximum segment sum is a well known problem. In this report we revisit the problem and focus on the algebraic properties of the operators which we exploit in constructing the solution. This allows us to produce a generic algorithm which solves a family of problems of which the maximum segment sum is just one instance. At the end we list a number of other instances.