kadane-algorithm/kadane.c at master · thinkphp/kadane-algorithm · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
#include <stdio.h>
#include <malloc.h>

int kadane(int *vec, int N) {

     int maxEndHere,
         maxSoFar,
         i;

     maxEndHere = 0; maxSoFar = -1000;

     for(i = 0; i < N; ++i) {

         maxEndHere +=  vec[i];

         if(maxEndHere > maxSoFar) maxSoFar = maxEndHere;

         if(maxEndHere < 0) maxEndHere = 0;

     }

     return maxSoFar;

}

int main(void) {

	int *A;
	int T, i, N;

	scanf("%d", &T);

	while (T--) {

		scanf("%d", &N);

		A = (int*)malloc(sizeof(int)*N);

		for (i = 0; i < N; i++)

			scanf("%d", &A[i]);

		printf("%d\n", kadane(A, N));
	}

	free(A);

	return 0;


}