Envío 2358

Código

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <vector>
#include <stack>
#include <algorithm>

using namespace std;
const int N = 6e5+20;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    
    int n;
    cin>>n;
    vector<long long> nums (n+1);
    vector<long long> sums (n+1);

    for(int i = 0; i < n; i++)
    {
        cin>>nums[i];
        if(i==0) sums[0] = nums[0];
        else sums[i] = sums[i-1] + nums[i];
        //cout<<sums[i]<<endl;
    }

    long long min = 999999999;
    long long res = -999999999;

    for(int i = 0; i < n; i++)
    {
        if(sums[i]<min)
        { 
            min = sums[i];
            res = max(res, max(nums[i], sums[i]));
        }
        else res = max(res, max(nums[i], max(sums[i]-min, sums[i])));
    }
    cout<<res<<endl;
}