// you can also use imports, for example:
// import java.util.*;

// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");

class Solution {
    public int solution(int[] A) {
        // write your code in Java SE 8
    }
}

// you can use includes, for example:
// #include <algorithm>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
}

// you can use includes, for example:
// #include <algorithm>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    vector<int> max;
    int result = 0;
    
    max.push_back(A[0]);
    
    for(int i = 1; i < A.size(); i++)
        max.push_back((max[i - 1] + A[i] > A[i]) ? max[i - 1] + A[i] : A[i]);
 
    for(int i = 0; i < max.size(); i++)
        result = (result < max[i]) ? max[i] : result;
        
    return result;
}

// you can use includes, for example:
// #include <algorithm>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    if(A.size() < 2)
        return A[0];
    
    vector<int> max;
    int result = 0;
    
    max.push_back(A[0]);
    
    for(int i = 1; i < A.size(); i++)
        max.push_back((max[i - 1] + A[i] > A[i]) ? max[i - 1] + A[i] : A[i]);
 
 
 
    for(int i = 0; i < max.size(); i++)
        result = (result < max[i]) ? max[i] : result;
        
    return result;
}

// you can use includes, for example:
// #include <algorithm>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    if(A.size() < 2)
        return A[0];
    
    vector<int> max;
    
    max.push_back(A[0]);
    
    for(int i = 1; i < A.size(); i++)
        max.push_back((max[i - 1] + A[i] > A[i]) ? max[i - 1] + A[i] : A[i]);
 
 
    int result = max[0];
 
    for(int i = 1; i < max.size(); i++)
        result = (result < max[i]) ? max[i] : result;
        
    return result;
}

// you can use includes, for example:
// #include <algorithm>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    if(A.size() < 2)
        return A[0];
    
    vector<int> max;
    
    max.push_back(A[0]);
    
    for(int i = 1; i < A.size(); i++)
        max.push_back((max[i - 1] + A[i] > A[i]) ? max[i - 1] + A[i] : A[i]);
 
 
    int result = max[0];
 
    for(int i = 1; i < max.size(); i++)
        result = (result < max[i]) ? max[i] : result;
        
    return result;
}

// you can use includes, for example:
// #include <algorithm>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    if(A.size() < 2)
        return A[0];
    
    vector<int> max;
    
    max.push_back(A[0]);
    
    for(int i = 1; i < A.size(); i++)
        max.push_back((max[i - 1] + A[i] > A[i]) ? max[i - 1] + A[i] : A[i]);
 
 
    int result = max[0];
 
    for(int i = 1; i < max.size(); i++)
        result = (result < max[i]) ? max[i] : result;
        
    return result;
}