Envío 2173

Código

#include <iostream>
#include <vector>

using namespace std;

long solve(const vector<long> &a) {
    long best = a[0];
    long current = a[0];
    for (int i = 1; i < a.size(); i++)
    {
        current = max(current + a[i], a[i]);
        best = max(best, current);
    }
    return best;
}

int main()
{
    int n;
    cin >> n;
    vector<long> a(n);
    for (int i = 0; i < n; i++)
    {
        cin >> a[i];
    }
    long best = solve(a);
    cout << best << endl;
    return 0;
}