Envío 2162

Código

#include <iostream>
#include <vector>
#include <bits/stdc++.h>

using namespace std;

int solve(const vector<int> &a) {
    
    int minv = INT_MAX;
    int maxv=INT_MIN;
    for (int i = 0; i < a.size(); i++) {
        minv = min(a[i], minv);
        maxv = max(a[i], maxv);
    }
    int best = maxv;
    int current = 0;
    for (int i = 0; i < a.size(); i++)
    {
        current = max(current + a[i], minv);
        best = max(best, current);
    }
    return best;
}

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