class Solution {
	public int solution(int[] A) {
		int N = A.length;
		int[] l = new int[N];
		int[] r = new int[N];
		for (int i = 1; i < N - 1; ++i) {
			l[i] = Math.max(l[i - 1] + A[i], 0);
		}
		for (int i = N - 2; i >= 0; --i) {
			r[i] = Math.max(r[i + 1] + A[i], 0);
		}
		int max = Integer.MIN_VALUE;
		for (int i = 1; i < N - 1; ++i) {
			max = Math.max(max, l[i - 1] + r[i + 1]);
		}
		return max;
	}
}