Max absolute value Range Sum

Asked Mar 20 '17 at 04:02

Active Mar 20 '17 at 05:01

Viewed 384 times

I have an array A containing integers (positive, negative or zero). So, I want to get the maximum absolute range sum (something like Kadane's algorithm, but with absolute value). For example, let A be:

A = [-3, 2 ,-3, 1]

so the answer there is 4 as abs(A[0] + A[1] + A[2]) = 4.

I tried to find the solution using Kadane's algorithm maintaining a current maximum sum, but it seems not to work in some cases. Is there a way to get the answer?

Expected time complexity: O(n*log(n))

asked Mar 20 '17 at 04:02

Arian Gallardo

2

Possible duplicate of [Finding minimal absolute sum of a subarray](http://stackoverflow.com/questions/25965939/finding-minimal-absolute-sum-of-a-subarray) – Shridhar R Kulkarni Mar 20 '17 at 04:07
I think you can use the Kadane's algorithm to find min sum and max sum, and compare the absolute value, then return the larger one – Petar Petrovic Mar 20 '17 at 04:35
@PetarPetrovic it worked! Thanks a lot, better than O(n*log(n)) – Arian Gallardo Mar 20 '17 at 05:05

Max absolute value Range Sum

0 Answers0