Envío 2236

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];
  }

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

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