FilesExpand file tree

 master

/

max_sum_subarray.cpp

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

45 lines (38 loc) · 855 Bytes

 master

/

max_sum_subarray.cpp

Copy path

Top

File metadata and controls

• Code
• Blame

45 lines (38 loc) · 855 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

/*

* Max sum of the subarray:

*

* Algorithm:

* use aux array to record the max_sum ending at each positon of array.

*

* Input array: a[];

*

* if known aux[i];

* aux[i+1] = aux[i]+a[i] // if aux[i]>0

* OR= a[i] // else

*/

#include <iostream>

using namespace std;

int max_subarray(int a[], int len)

{

int aux[len];

aux[0] = a[0];

int max_sum = a[0];

for(int i=1; i<len; i++) {

if(aux[i-1]>0) {

aux[i] = aux[i-1]+a[i];

} else {

aux[i] = a[i];

}

if(aux[i]>max_sum) {

max_sum = aux[i];

}

}

return max_sum;

}

int main()

{

int a[] = {-2,9,-3,4,-1,2,1,-5,4};

int len = sizeof(a)/sizeof(int);

cout << "max subarray sum: " << max_subarray(a, len) << endl;

return 0;

}