一个数组中连续子数组的最大和

//连续子数组的最大和//{1,-2,3,10,-4,7,2,-5};//最大子数组18#include<iostream>usingnamespacestd;boolg_InValid=false;intFindGreatSumOfSubArray(int*arr,intsize){if(arr==NULL||size<=0)g_InValid=true;g_InValid=false;intcurSum=0;intgreatSum=0x80000000;for(inti=0;i<size;++i){if(curSum<=0){curSum=arr[i];}elsecurSum+=arr[i];if(curSum>greatSum)greatSum=curSum;}returngreatSum;}voidTest1(){intarr[]={1,-2,3,10,-4,7,2,-5};//最大子数组18if(!g_InValid){cout<<FindGreatSumOfSubArray(arr,sizeof(arr)/sizeof(arr[0]))<<endl;}}