Table of Contents
1 relation: Maximum subarray problem.
Maximum subarray problem
In computer science, the maximum sum subarray problem, also known as the maximum segment sum problem, is the task of finding a contiguous subarray with the largest sum, within a given one-dimensional array A of numbers.
See Maximum segment sum problem and Maximum subarray problem

