线性扫描算法求数组中的最大子序列

#include <stdio.h>

int main() {
    int i, size = 0, maxEle = 0, currEle = 0;
    int currEleStart = 0, currEleEnd = 0;

    scanf("%d", &size);
    int arr[size];

    for(i = 0; i < size; i++) {
        scanf("%d", &arr[i]);
        currEle += arr[i];

        if (currEle >= 0 && maxEle == 0) {
            currEleStart = arr[i];
        }

        if (currEle > maxEle) {
            maxEle = currEle;
            currEleEnd = arr[i];
        }

        else if (currEle < 0) {
            currEle = 0;
        }
    }
    printf("%d %d %d", maxEle, currEleStart, currEleEnd);
    return 0;
}