Data commit

Task/Greatest-subsequential-sum/C/greatest-subsequential-sum.c

@@ -0,0 +1,48 @@
+#include "stdio.h"
+
+typedef struct Range {
+    int start, end, sum;
+} Range;
+
+Range maxSubseq(const int sequence[], const int len) {
+    int maxSum = 0, thisSum = 0, i = 0;
+    int start = 0, end = -1, j;
+
+    for (j = 0; j < len; j++) {
+        thisSum += sequence[j];
+        if (thisSum < 0) {
+            i = j + 1;
+            thisSum = 0;
+        } else if (thisSum > maxSum) {
+            maxSum = thisSum;
+            start = i;
+            end   = j;
+        }
+    }
+
+    Range r;
+    if (start <= end && start >= 0 && end >= 0) {
+        r.start = start;
+        r.end = end + 1;
+        r.sum = maxSum;
+    } else {
+        r.start = 0;
+        r.end = 0;
+        r.sum = 0;
+    }
+    return r;
+}
+
+int main(int argc, char **argv) {
+    int a[] = {-1 , -2 , 3 , 5 , 6 , -2 , -1 , 4 , -4 , 2 , -1};
+    int alength = sizeof(a)/sizeof(a[0]);
+
+    Range r = maxSubseq(a, alength);
+    printf("Max sum = %d\n", r.sum);
+    int i;
+    for (i = r.start; i < r.end; i++)
+        printf("%d ", a[i]);
+    printf("\n");
+
+    return 0;
+}