最大连续子数组和

#include<iostream>

#include <time.h>

using namespace std;

int MaxSubArray(int* a, int n);

int main()

{

int data[] = {0,-1,2,4,7,-8,11,15};

int sum = MaxSubArray(data, 8);

cout<<"最大值为："<<sum<<endl;

while(true)

;

return 0;

}

int MaxSubArray(int data[], int length)

{

if(data == NULL || length <= 0) // 数据输入合法性检验

return false;

int sum = 0;

int curSum = 0;

for(int i = 0; i < length; ++i)

{

if(curSum <= 0)

curSum = data[i];

else

curSum += data[i];

if(curSum > sum)

sum = curSum;

}

return sum;

}