浙大版《數據結構（第2版）》題目集 實例1.1 最大子列和問題 (20分)

6
-2 11 -4 13 -5 -2

#include <iostream>
using namespace std;
struct list
{
    int a;
    struct list *next;
};
int main()
{
    int n;
    int max = 0, now = 0;
    cin >> n;
    struct list *head;
    struct list *p1, *p2;
    head = p2 = new (struct list);
    cin >> p2->a;
    for (int i = 0; i < n; i++) //輸入被測試數據
    {
        p1 = new (struct list);
        cin >> p1->a;
        p2->next = p1;
        p2 = p1;
    }
    p2->next = NULL;
    p1 = head;
    while (p1 != NULL) //遍歷鏈表 找出最大子列和
    {
        now += p1->a;
        if (now <= 0)
            now = 0;
        if (now > max)
            max = now;
        p1 = p1->next;
    }
    while (p1 != NULL) //釋放內存
    {
        p2 = p1->next;
        delete p1;
        p1 = p2;
    }
    cout << max;
    return 0;
}