{

if (numbers && length>0) {

int *max_begin, *max_end;

int max_sum = 0x80000000;

int *cur_max_begin, *cur_max_end;

int cur_sum = 0;

cur_max_begin = cur_max_end = numbers;

int i = 0;

while(i < length) {

if (cur_sum <= 0) {

cur_sum = numbers[i];

cur_max_begin = numbers + i;

cur_max_end = cur_max_begin;

} else {

cur_sum += numbers[i];

cur_max_end = numbers + i;

}

if (max_sum < cur_sum) {

max_sum = cur_sum;

max_begin = cur_max_begin;

max_end = cur_max_end;

}

i++;

}

cout << "max sum: " << max_sum << endl;

for (;max_begin<=max_end; max_begin++) {

cout << *max_begin << ' ';

}

cout << endl;

}

{

int numbers_test1[8] = {1, -2, 3, 10, -4, 7, 2, -5};

int numbers_test2[8] = {-5, -2, 3, -10, -4, 7, 2, -5};

int numbers_test3[8] = {-5, -2, -3, -10, -4, -7, -2, -5};

int numbers_test4[8] = {5, 2, 3, 10, 4, 7, 2, 5};

find_greateat_sum_of_subarray(numbers_test1, 8);

find_greateat_sum_of_subarray(numbers_test2, 8);

find_greateat_sum_of_subarray(numbers_test3, 8);

find_greateat_sum_of_subarray(numbers_test4, 8);

return 0;