// 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
    }
}

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int[] fowardMaxSum = new int[A.length];
        int[] backwardMaxSum = new int[A.length];
        int maxSum = 0;
        
        for (int i=1; i<A.length-1; i++) {
            fowardMaxSum[i] = Math.max(fowardMaxSum[i-1] + A[i], 0);
        }
        
        for (int i=A.length-2; i>1; i--) {
            backwardMaxSum[i] = Math.max(backwardMaxSum[i+1] + A[i], 0);
        }
        
        for (int i=2; i<A.length-1; i++) {
            maxSum = Math.max(maxSum, fowardMaxSum[i-1] + backwardMaxSum[i+1]);
        }
        
        return maxSum;
    }
}

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int[] fowardMaxSum = new int[A.length];
        int[] backwardMaxSum = new int[A.length];
        int maxSum = 0;
        
        for (int i=1; i<A.length-1; i++) {
            fowardMaxSum[i] = Math.max(fowardMaxSum[i-1] + A[i], 0);
        }
        
        for (int i=A.length-2; i>1; i--) {
            backwardMaxSum[i] = Math.max(backwardMaxSum[i+1] + A[i], 0);
        }
        
        for (int i=2; i<A.length-1; i++) {
            maxSum = Math.max(maxSum, fowardMaxSum[i-1] + backwardMaxSum[i+1]);
        }
        
        return maxSum;
    }
}

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int[] fowardMaxSum = new int[A.length];
        int[] backwardMaxSum = new int[A.length];
        int maxSum = 0;
        
        for (int i=1; i<A.length-1; i++) {
            fowardMaxSum[i] = Math.max(fowardMaxSum[i-1] + A[i], 0);
        }
        
        for (int i=A.length-2; i>1; i--) {
            backwardMaxSum[i] = Math.max(backwardMaxSum[i+1] + A[i], 0);
        }
        
        for (int i=1; i<A.length-1; i++) {
            maxSum = Math.max(maxSum, fowardMaxSum[i-1] + backwardMaxSum[i+1]);
        }
        
        return maxSum;
    }
}

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int[] fowardMaxSum = new int[A.length];
        int[] backwardMaxSum = new int[A.length];
        int maxSum = 0;
        
        for (int i=1; i<A.length-1; i++) {
            fowardMaxSum[i] = Math.max(fowardMaxSum[i-1] + A[i], 0);
        }
        
        for (int i=A.length-2; i>1; i--) {
            backwardMaxSum[i] = Math.max(backwardMaxSum[i+1] + A[i], 0);
        }
        
        for (int i=1; i<A.length-1; i++) {
            maxSum = Math.max(maxSum, fowardMaxSum[i-1] + backwardMaxSum[i+1]);
        }
        
        return maxSum;
    }
}

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int[] fowardMaxSum = new int[A.length];
        int[] backwardMaxSum = new int[A.length];
        int maxSum = 0;
        
        for (int i=1; i<A.length-1; i++) {
            fowardMaxSum[i] = Math.max(fowardMaxSum[i-1] + A[i], 0);
        }
        
        for (int i=A.length-2; i>1; i--) {
            backwardMaxSum[i] = Math.max(backwardMaxSum[i+1] + A[i], 0);
        }
        
        for (int i=1; i<A.length-1; i++) {
            maxSum = Math.max(maxSum, fowardMaxSum[i-1] + backwardMaxSum[i+1]);
        }
        
        return maxSum;
    }
}

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int[] fowardMaxSum = new int[A.length];
        int[] backwardMaxSum = new int[A.length];
        int maxSum = 0;
        
        for (int i=1; i<A.length-1; i++) {
            fowardMaxSum[i] = Math.max(fowardMaxSum[i-1] + A[i], 0);
        }
        
        for (int i=A.length-2; i>1; i--) {
            backwardMaxSum[i] = Math.max(backwardMaxSum[i+1] + A[i], 0);
        }
        
        for (int i=1; i<A.length-1; i++) {
            maxSum = Math.max(maxSum, fowardMaxSum[i-1] + backwardMaxSum[i+1]);
        }
        
        return maxSum;
    }
}