the Kadane algorithm became the solution to the maximum subarray problem

Modify these so that he is the bidding great Weight met. Even the smallest or the largest weight, depending on the that has the big report. Your Python implementation should be as before in a certain pass. Example: For the sequence [3, -8, 3, -10, 0, 2, -9, 4] the algorithm -22 should be returned