求长度为n的数组中，加和最大的子数组

输入：8
          1 -2 3 10 -4 7 2 -5
输出：Mxasum = 18

           3 10 -4 7 2 

代码：

#include<stdio.h>
int getmaxsum(int *a, int n,int *start,int *end)
{
if((a == NULL)||n<=0)
{
return 0;
}
int bigmax = 0;
int sum = 0;
int i;
*start =  *end = 0;
for(i = 0;i<n;i++)
{
if(sum < 0)//如果之前的数组和小于0 则子数组从新开始
{
sum = a[i];
*start = i;
}else {
sum = sum + a[i];
}


if(sum > bigmax)
{
bigmax = sum ;
*end = i;
}
}

return bigmax;
}
int main()
{
int a[1024];
int n;
scanf("%d",&n);
int i;
for(i = 0;i<n;i++)
{
scanf("%d",&(a[i]));
}
int start,end;
int Maxsum = getmaxsum(a,n,&start,&end);
printf("Mxasum = %d\n",Maxsum);
for(i = start;i<=end;i++)
{
printf("%d ",a[i]);
}
printf("\n");
}