01-复杂度2 Maximum Subsequence Sum

链表做法：

#pragma warning(disable:4996)

#include 
#include 

typedef struct Node *List;
struct Node
{
	int number;
	List next;
};

List Create(int number);

int main()
{
	int inputnumber,max,max_1,front,rear,front_1;
	List L,temp;
	scanf("%d",&inputnumber);
	L=Create(inputnumber);
	max = -1;
	max_1 = 0;
	front = 0;
	rear = 0;
	front_1 = L->number;
	front = L->number;
	for (int i = 0; i < inputnumber; i++)
	{
		temp = L;
		max_1 += temp->number;
		temp = temp->next;
        if (max_1 > max)
        {
            max = max_1;
            front = front_1;
            rear = L->number;
        }
		if (max<0 )
		{
			rear = L->number;
		}
		L = L->next;
		if (max_1 < 0 && L)
		{
			front_1 = L->number;
            max_1 = 0;
		}
	}
	if (max<0)
	{
		max = 0;
	}
	printf("%d %d %d",max,front,rear);
	return 0;
}

List Create(int number)
{
	List L,t,cycle;
	int i,data;
	L = (List)malloc(sizeof(struct Node));
	L->next = NULL;
	t = L;
	i = 0;
	for (i=0;inumber = data;
		t->next = temp;
		t = temp;
	}
	t->next = NULL;
	cycle = L;
	L = L->next;
	free(cycle);
	return L;
}

题源中国mooc