// 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)
    
    int len = A.size();
    int result = 0;
    vector<int> left_max(len);
    vector<int> right_max(len);
    
    if(A.size() < 4)
        return 0;
    
    for(int i = 1;  i < len - 1; i++)
        left_max[i] = max(left_max[i - 1] + A[i] , 0);
    
    for(int i = len - 1; i > 1; i--)
        right_max[i - 1] = max(right_max[i] + A[i - 1], 0);
        
    for(int i = 1; i < left_max.size() - 1; i++)
        result = max(left_max[i - 1] + right_max[i + 1], 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)
    
    int len = A.size();
    int result = 0;
    vector<int> left_max(len);
    vector<int> right_max(len);
    
    if(A.size() < 4)
        return 0;
    
    for(int i = 1;  i < len - 1; i++)
        left_max[i] = max(left_max[i - 1] + A[i] , 0);
    
    for(int i = len - 1; i > 1; i--)
        right_max[i - 1] = max(right_max[i] + A[i - 1], 0);
        
    for(int i = 1; i < len - 1; i++)
        result = max(left_max[i - 1] + right_max[i + 1], 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)
    
    int len = A.size();
    int result = 0;
    vector<int> left_max(len);
    vector<int> right_max(len);
    
    if(A.size() < 4)
        return 0;
    
    for(int i = 1;  i < len - 1; i++)
        left_max[i] = max(left_max[i - 1] + A[i] , 0);
    
    for(int i = len - 1; i > 1; i--)
        right_max[i - 1] = max(right_max[i] + A[i - 1], 0);
        
    for(int i = 1; i < len - 1; i++)
        result = max(left_max[i - 1] + right_max[i + 1], 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)
    
    int len = A.size();
    int result = 0;
    vector<int> left_max(len);
    vector<int> right_max(len);
    
    if(A.size() < 4)
        return 0;
    
    for(int i = 1;  i < len - 1; i++)
        left_max[i] = max(left_max[i - 1] + A[i] , 0);
    
    for(int i = len - 1; i > 1; i--)
        right_max[i - 1] = max(right_max[i] + A[i - 1], 0);
        
    for(int i = 1; i < len - 1; i++)
        result = max(left_max[i - 1] + right_max[i + 1], result);
    
    return result;
}