求数组中最大子数组和及坐标

给定数组（内含正负数）， 求其中和最大的子数组。

如  { 8,-9,7,1,2,2,-9}   应返回 12

 

代码如下：

int maxSummaryClear_DP(int arr[], int length){assert( arr && length);int sum = arr[0];int maxSum = arr[0];int b=0, e=0;// begin and endint bb=b, ee=e;cout<< endl;for (int i=0;i<length;i++){std::cout<<arr[i]<<",";}cout<<endl<<maxSum<<" -> ";for (int i=1; i<length; i++){if (sum > 0){sum += arr[i];ee = i;}else{sum = arr[i];ee = bb = i;}if (sum > maxSum){maxSum= sum;b = bb;e = ee;}cout<<maxSum<<" -> ";}cout<<endl<<"at("<<b<<","<<e<<")"<<endl;return maxSum;}

 

测试：

void t_maxSubs(){std::cout<<endl<<"maxSums:"<<endl;// 3,-1,43,-13,-1,-14,-2,14,-1,-1,1int numbers1[]= { 3,-2,4,-1,3,-5,8,-9,15,-12,20,3,-1 };int numbers2[]= {3,-1,4};int numbers3[]= {-1,-2,-1,3,-1};int numbers4[]= {-2,-1,-2,3,-1,-1};int numbers5[]= {4,-2,1};int numbers6[]= {4,-1,-1,1};int numbers7[]= { -2, -3, -5, -2, -1,-9};int numbers8[]= { 8, -9, 7, 1, 2,2,-9};typedef int (*PF)(int*,int);PF pf=&maxSummaryClear_DP;int res;res = pf(numbers1, sizeof(numbers1)/sizeof(int));std::cout<<endl<<res<<endl;res = pf(numbers2, sizeof(numbers2)/sizeof(int));std::cout<<endl<<res<<endl;res = pf(numbers3, sizeof(numbers3)/sizeof(int));std::cout<<endl<<res<<endl;res = pf(numbers4, sizeof(numbers4)/sizeof(int));std::cout<<endl<<res<<endl;res = pf(numbers5, sizeof(numbers5)/sizeof(int));std::cout<<endl<<res<<endl;res = pf(numbers6, sizeof(numbers6)/sizeof(int));std::cout<<endl<<res<<endl;res = pf(numbers7, sizeof(numbers7)/sizeof(int));std::cout<<endl<<res<<endl;res = pf(numbers8, sizeof(numbers8)/sizeof(int));std::cout<<endl<<res<<endl;}