Maximum Sum of continuous subarrays

 

# Include <stdlib. h> # include <stdio. h> # include <time. h >#include <ctime> # include <algorithm> # define arrlen 10 using namespace STD; int maxsubarray (int A [], int size) {If (size <= 0) return 0; int sum = 0; int max =-(1 <31); // The Initialization is minimal to avoid affecting int cur = 0; while (cur <size) {sum + = A [cur ++]; If (sum> MAX) {max = sum;} else if (sum <0) {sum = 0 ;}} return Max;} int main (void) {int arr [arrlen] = {,-,}; printf ("% d ", maxsubarray (ARR, arrlen); getchar (); Return 0 ;}