Solution to http://www.tcgs.tc.edu.tw:1218/ShowProblem?problemid=b026

b026.cpp

#include <iostream>  
  
using namespace std;  
  
int main()  
{  
    int n;  
    cin >> n;  
  
    int seq[n];  
    for(int i = 0; i < n; i++)  
        cin >> seq[i];  
  
    int best_sum = INT_MIN;  
    int current_sum = 0;  
  
    for(int i = 0; i < n; i++)  
    {  
        current_sum = max(0, (current_sum + seq[i]));  
        best_sum = max(best_sum, current_sum);  
    }  
  
    cout << best_sum << " " << endl;  
    return 0;  
}