Submission #2839440

---

Source Code Expand

import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int[] a = new int[n];
		for(int i = 0; i < n; i++) a[i] = sc.nextInt();
		int ans = -Integer.MAX_VALUE;
		// 高橋くんの選び方
		for(int i = 0; i < n; i++) {
			int maxA = -Integer.MAX_VALUE, maxT = -Integer.MAX_VALUE;
			// 青木くんの選び方
			for(int j = 0; j < n; j++) {
				if(i == j) continue;
				int sumT = 0, sumA = 0;
				if(i < j) {
					for(int k = i; k <= j; k++) {
						if((k - i) % 2 == 0) sumT += a[k];
						else sumA += a[k];
					}
				} else {
					for(int k = j; k <= i; k++) {
						if((k - j) % 2 == 0) sumT += a[k];
						else sumA += a[k];
					}
				}
				if(maxA < sumA) {
					maxT = sumT;
					maxA = sumA;
				}
			}
			ans = Math.max(ans, maxT);
		}
		System.out.println(ans);
	}
}

Submission Info

Judge Result