Maximo Vezzosi vezzmax
vezzmax
/ max_sum.rb
Created
October 17, 2013 01:53
This solution is linear and basically has an array called us (last sequence) and ms (max sequence). This array structure is as follows: [start sequence index, end sequence index, sum]. Then is computing the sum and saving the best partial sequence in ms. It returns an array with the above described structure. For instance, for input [-1, 5, 6, -…
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| # arreglo = [-1, 5, 6, -2, 20, -50, 4] | |
| def max_sum (a) | |
| us = [0,0,a[0]] | |
| ms = Array.new(us) | |
| for i in 1..a.size-1 do | |
| new_sum = us[2] + a[i] | |
| if (new_sum < 0 or new_sum < a[i]) then | |
| us = [i,i,a[i]] |