" the maximum subarray problem is the task of finding the contiguous subarray within a one-dimensional array of numbers (containing at least one positive number) which has the largest sum" see http://en.wikipedia.org/wiki/Maximum_subarray_problem