求数组中和最大的一串数据

#include<iostream>
#include<string>
#include<math.h>
using namespace std;



int main()
{
int a[] = {-100,50,23,34,-300,34,6 ,3,-1000};

int maxsofar = 0;
int sum = 0;

int k = 0;
int len = 0;
int max_start;
int max_len;

for (int i = 0;i < 9;i++)
{
if (sum < 0)
{
sum = 0;
k = i;
len = 0;
}

sum += a[i];
++ len;

if (maxsofar < sum)
{
maxsofar = sum;
max_start = k;
max_len = len;
}

}

cout << maxsofar << endl;
cout << "start: " << max_start << endl;
cout << "len: " << max_len << endl;
return 0;
}