"Beauty of programming" 2.14 The maximum value of the sum of the subarray of the array

Have done, just say the idea.

Records the maximum sum in a subarray of a[0...n-1] that ends with the first element in sum,

If the sub-array ending with the i-1 element is less than 0, then the largest of the sub-arrays ending with the first element is a[i] itself otherwise a[i] + Sum (i-1)

Summing up is sum = (sum > 0)? A[i] + sum:a[i];

Then record the maximum value of all occurrences of sum.

#include <stdio.h>intGetmaxsubarraysum (intBintAlen) {    intMaxsum = a[0]; intSum = a[0];  for(inti =1; I < Alen; i++) {Sum= (Sum >0) ? Sum +A[i]: a[i]; Maxsum= (Sum > Maxsum)?sum:maxsum; }    returnmaxsum;}intMain () {inta[7] = {-2,5,3,-6,4,-8,6}; intb[6] = {1,-2,3,5,-3,2}; intc[6] = {0,-2,3,5,-1,2}; intd[5] = {-9,-2,-3,-5,-3}; intmax = Getmaxsubarraysum (d,5); return 0;}

"Beauty of programming" 2.14 The maximum value of the sum of the subarray of the array