Envío 2157

Código

#include <iostream>
#include <vector>

using namespace std;

int solve(const vector<int> &a) {
   int best = a[0];
	int current = best;
	int best_single = best;
   for (int i = 0; i < a.size(); i++)
   {
	 best_single = max(a[i], best_single);
	  current = max(current + a[i], best_single);
	  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;
}