01-复杂度2 Maximum Subsequence Sum

#include <stdio.h>
#include <stdlib.h>

int main() {
    int K = 0;
    scanf("%d", &K);
    int a[K];
    for(int i=0; i<K; i++)
        scanf("%d",&a[i]);
    int MaxSum = -1;
    int ThisSum = 0;
    int low = 0;
    int newlow = 0;
    int high = K-1;
    for(int i=0; i<K; i++) {
        ThisSum += a[i];
        if(ThisSum > MaxSum) {
            MaxSum = ThisSum;
            low = newlow;
            high = i;
        } else if(ThisSum < 0) {
            ThisSum = 0;
            newlow = i+1;
        }
    }
    if(MaxSum<0)
        MaxSum = 0;
    printf("%d %d %d\n", MaxSum,a[low],a[high]);
    return 0;
}