int MaxSubSum(int *arr,int len)
{
int i;
int MaxSum = 0;
int CurSum = 0;
for(i=0;i
{
CurSum += arr[i];
if(CurSum > MaxSum)
MaxSum = CurSum;
//如果累加和出現(xiàn)小于0的情況,
//則和最大的子序列肯定不可能包含前面的元素,
//這時(shí)將累加和置0击你,從下個(gè)元素重新開始累加
if(CurSum < 0)
CurSum = 0;
}
return MaxSum;
}