Submission #2165881


Source Code Expand

N = int(input())
a = list(map(int,input().split()))

INF = 10**10
res = -INF
for i in range(N):
	MaxAoki = -INF
	MaxTakahashi = -INF
	for j in range(N):
		if i == j:
			continue
		T = []
		for k in range(min(i,j), max(i,j)+1):
			T.append(a[k])
		Takahashi = 0
		Aoki = 0		
		for k in range(len(T)):
			if k % 2 == 0:
				Takahashi += T[k]
			else:
				Aoki += T[k]
		if Aoki > MaxAoki:
			MaxAoki = Aoki
			MaxTakahashi = Takahashi
		res = max(res, MaxTakahashi)

print(res)

Submission Info

Submission Time
Task C - 数列ゲーム
User ty70
Language Python (3.4.3)
Score 0
Code Size 501 Byte
Status WA
Exec Time 40 ms
Memory 3064 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
AC × 3
AC × 17
WA × 6
Set Name Test Cases
Sample sample-01.txt, sample-02.txt, sample-03.txt
All sample-01.txt, sample-02.txt, sample-03.txt, test-01.txt, test-02.txt, test-03.txt, test-04.txt, test-05.txt, test-06.txt, test-07.txt, test-08.txt, test-09.txt, test-10.txt, test-11.txt, test-12.txt, test-13.txt, test-14.txt, test-15.txt, test-16.txt, test-17.txt, test-18.txt, test-19.txt, test-20.txt
Case Name Status Exec Time Memory
sample-01.txt AC 17 ms 3064 KB
sample-02.txt AC 17 ms 3064 KB
sample-03.txt AC 17 ms 3064 KB
test-01.txt WA 17 ms 3064 KB
test-02.txt AC 18 ms 3064 KB
test-03.txt AC 19 ms 3064 KB
test-04.txt WA 23 ms 3064 KB
test-05.txt AC 29 ms 3064 KB
test-06.txt AC 31 ms 3064 KB
test-07.txt WA 35 ms 3064 KB
test-08.txt AC 37 ms 3064 KB
test-09.txt WA 37 ms 3064 KB
test-10.txt AC 37 ms 3064 KB
test-11.txt AC 36 ms 3064 KB
test-12.txt AC 36 ms 3064 KB
test-13.txt WA 37 ms 3064 KB
test-14.txt AC 36 ms 3064 KB
test-15.txt WA 36 ms 3064 KB
test-16.txt AC 37 ms 3064 KB
test-17.txt AC 40 ms 3064 KB
test-18.txt AC 37 ms 3064 KB
test-19.txt AC 37 ms 3064 KB
test-20.txt AC 36 ms 3064 KB