01-复杂度1 最大子列和问题

#include <stdio.h>int MaxSubseqSum(const int A[], int N){int ThisSum = 0, 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;}int main(int argc, char const *argv[]){int Subseq[100000], N, MaxSum = 0;scanf("%d", &N);for (int i = 0; i < N; i++)scanf("%d", &Subseq[i]);MaxSum = MaxSubseqSum(Subseq, N);printf("%d", MaxSum);return 0;}