#include "stdafx.h"
#include <iostream>int SubArraySumMax(int arr[], int len);using namespace std;int main(int argc, char* argv[])
{int arr[] = {1, -2, 3, 10, -4, 7, 2, -5};int summax = SubArraySumMax(arr,8);cout<<summax<<endl;return 0;
}int SubArraySumMax(int arr[], int len)
{int i,j;int summax = 0;int sum_temp;for(i=0; i<len; i++){if(summax < arr[i])summax = arr[i];sum_temp = arr[i];for(j=i+1; j<len; j++){sum_temp += arr[j];if(sum_temp > summax)summax = sum_temp;}}return summax;
}

// jianzhioffer3.cpp : Defines the entry point for the console application.
//

#include "stdafx.h"
#include <iostream>
//int SubArraySumMax(int arr[], int len);
bool FindGreatestSumOfSubArray
(int *pData,           // an arrayunsigned int nLength, // the length of arrayint &nGreatestSum     // the greatest sum of all sub-arrays
);
using namespace std;/*int main(int argc, char* argv[])
{int arr[] = {1, -2, 3, 10, -4, 7, 2, -5};int summax = SubArraySumMax(arr,8);cout<<summax<<endl;return 0;
}int SubArraySumMax(int arr[], int len)
{int i,j;int summax = 0;int sum_temp;for(i=0; i<len; i++){if(summax < arr[i])summax = arr[i];sum_temp = arr[i];for(j=i+1; j<len; j++){sum_temp += arr[j];if(sum_temp > summax)summax = sum_temp;}}return summax;
}*/int main()
{int arr[] = {1, -2, 3, 10, -4, 7, 2, -5};int nLength = 8;int nGreatestSum;bool IfSuccess = FindGreatestSumOfSubArray(arr,nLength,nGreatestSum);if(IfSuccess)cout<<nGreatestSum<<endl;elsecout<<"Input Error!"<<endl;return 0;
}/////
// Find the greatest sum of all sub-arrays
// Return value: if the input is valid, return true, otherwise return false
/////
bool FindGreatestSumOfSubArray
(int *pData,           // an arrayunsigned int nLength, // the length of arrayint &nGreatestSum     // the greatest sum of all sub-arrays
)
{// if the input is invalid, return falseif((pData == NULL) || (nLength == 0))return false;int nCurSum = nGreatestSum = 0;for(unsigned int i = 0; i < nLength; ++i){nCurSum += pData[i];// if the current sum is negative, discard itif(nCurSum < 0)nCurSum = 0;// if a greater sum is found, update the greatest sumif(nCurSum > nGreatestSum)nGreatestSum = nCurSum;}// if all data are negative, find the greatest element in the arrayif(nGreatestSum == 0){nGreatestSum = pData[0];for(unsigned int i = 1; i < nLength; ++i){if(pData[i] > nGreatestSum)nGreatestSum = pData[i];}}return true;
}