MMSUM _ Can anyone check whats problem with my code?

kshreyans_1 · July 30, 2018, 12:43pm

MySolution
I tried to get the maximum sum and while searching for that obtaining its initial and final positions.
Thanking you in advance.

l_returns · July 30, 2018, 4:32pm

HERE is an very simple optimised one loop DP approach… Better than editorial approach…
I can help with your approach if you explain it…

l_returns · July 30, 2018, 4:52pm

thanks for this question… I liked solving it…

kshreyans_1 · July 31, 2018, 2:14pm

In my approach, i’m calculating the sum of the elements in array whenever my sum is less than any positive array element i reset the i.e sum=a[i] and set a new position (ipos=i). And for ending position whenever my sum is greater than max_sum ,I store that index as end position.

When i got these sum, ipos n epos.
I traverse that segment and tried find a negative number for removal.
And max-(negative number)=max+number.

Thanks buddy.