Envío 2355

Código

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <vector>
#include <stack>
#include <algorithm>
#define forn(a, n) for(int a = 0; a<(int) (n); ++a)
#define rforn(a, n) for(int a = (n)-1; a>=0; --a)
using namespace std;
const int N = 6e5+20;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    
    int n;
    cin>>n;
    vector<int> nums (n+1);
    vector<int> 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;
    }

    int minimo = 999999999;
    int suma = 0;
    int res = nums[0];

    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])));*/

        //Mejia's algorithm
        suma += nums[i];
        res = max(res, suma-minimo);
        minimo = min(minimo, suma); 
    }
    cout<<res<<endl;
}