这个题是在第1题基础上加了最大子列的开头结尾两个元素的检测
其中C语言函数返回数组参考http://www.runoob.com/cprogramming/c-return-arrays-from-function.html
#include <stdio.h>
int* MaxSubSeqSum(int A[], int N)
{
static int M[3]; //存放三个返回值的数组
int sum = 0;
int maxsum = 0;
int Start = 0;
int End = 0;
int len = 0; //记录最大子列的长度
for(int i=0; i<N; i++)
{
sum += A[i];
if(sum>maxsum){
maxsum = sum;
len += 1;
End = i;
Start = End -len +1;
}
else if(sum<0){
sum = 0;
len = 0;
//Start = i+1;
//End = i+1;
}
}
M[0] = maxsum;
M[1] = Start;
M[