Envío 2237

Código

#include <vector>
#include <iostream>
#include <limits>
using namespace std;

int main() {
  int n;
  cin >> n;

  vector<long long> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }

  long long previous = a[0];
  long long best = previous;
  for (int j = 1; j < n; j++) {
    previous = max(a[j], previous + a[j]);
    best = max(best, previous);
  }

  cout << best << endl;
  return 0;
}