浙大数据结构课后题-最大子列和

动态规划法

int MaxSubseqSum1(int A[], int N){int ThisSum, MaxSum;ThisSum = MaxSum = 0;for (int i = 0; i < N; i++){ThisSum += A[i];if (ThisSum > MaxSum)MaxSum = ThisSum;else if (ThisSum < 0)ThisSum = 0;}return MaxSum;}