求巨佬看看，救救孩子啊

#include <bits/stdc++.h>
using namespace std;
#define int long long //不开long long见祖宗
int n, a[1000010], f[1000010], ans = -99999999;
signed main()
{
    memset(f, 0, sizeof(f));
    scanf("%lld", &n);
    for(int i = 1; i <= n; i++){
        scanf("%lld", &a[i]);
    } //输入
    ans = a[1];
    f[1] = a[1];
    for(int i = 2; i <= n; i++){
        f[i] = f[i - 1] + a[i];
        if(f[i] < 0){
            f[i] = a[i];
        } // f[i]值到第i项的最大字段和，如果f[i - 1]小于0了，那就不如不要它
        ans = max(ans, f[i]);
        printf("%lld ", f[i]);
    }
    printf("%lld", ans); //输出
    return 0;
}