字数组的最大和

#include <iostream>
using namespace std;
int maxSubArray(int a[], int size)
{
int max = -(1 << 31);
int i = 0, j = 0;
int sum = 0;
int subArray[size];
int start = 0, count = 0, maxstart = 0, maxcount = 0; //因为不知道什么时候会是最优解，所以先保存之前的最优解 

for(i = 0; i < size; i++)
{
sum+=a[i];
count++;
if(sum > max)
{
max = sum;
maxstart = start;
maxcount = count;
}
else //当现在的子序列之和小于之前的，那么继续向后加，保持现在 
{ //的子序列 
if(sum < 0) //当之前的子序列之和为负数，那么sum设置为0
{
sum = 0;  
count = 0;
start = i+1;
}
}
}
if(sum < 0)
{
max = a[0];
for(i =1; i < size; i++)
{
if(a[i] > max)
max = a[i];
} 
cout << max;
return max;
}
for(i = maxstart; i <= maxstart + maxcount -1; i++)
{
cout << a[i] << ' ';
}
cout << endl;
return max; 
}
int main()
{
int a[] = {-1,-2,3,10,-4,7,-2};
cout << maxSubArray(a,sizeof(a)/sizeof(int)) << endl;
// cout << (1 << 31) <<endl; 
 return 0;
}