#include <iostream> #include <vector> #include <algorithm> using namespace std; int maxSubArraySum(vector<int>& nums) { int size = nums.size(); int max_so_far = INT_MIN, max_ending_here = 0; for (int i = 0; i < size; i++) { max_ending_here = max_ending_here + nums[i]; if (max_so_far < max_ending_here) max_so_far = max_ending_here; if (max_ending_here < 0) max_ending_here = 0; } return max_so_far; } int main() { int n; cin >> n; vector<int> a(n); for (int i = 0; i < n; ++i) { cin >> a[i]; } int result = maxSubArraySum(a); cout << result << endl; return 0; }