Submission #2183169


Source Code Expand

N = int(input())
a = list(map(int, input().split()))
position = []
for i in range(N): #高橋くんのindex=tmp
    candinate = []
    for j in range(N): #青木くんのindex=tmp2
        if i == j:
            continue
        else:
            b = a[min(i,j):max(i,j)+1]  #区間を得る。
            candinate.append((sum([ b[k] for k in range(1,len(b),2) ]), j))
    position.append(max(candinate, key=lambda tmp:tmp[0])[1]) #bの区間で偶数番目の数値の合計の中から最も大きかったときの青木くんのindexを保存。
maximum = []
for i in range(len(position)):
    c = a[min(i,position[i]):max(i,position[i])+1]
    maximum.append(sum([ c[j] for j in range(0, len(c), 2) ]))
print(max(maximum))

Submission Info

Submission Time
Task C - 数列ゲーム
User dexctercom
Language Python (3.4.3)
Score 100
Code Size 745 Byte
Status AC
Exec Time 24 ms
Memory 3064 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 23
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 AC 17 ms 3064 KB
test-02.txt AC 17 ms 3064 KB
test-03.txt AC 18 ms 3064 KB
test-04.txt AC 19 ms 3064 KB
test-05.txt AC 20 ms 3064 KB
test-06.txt AC 21 ms 3064 KB
test-07.txt AC 23 ms 3064 KB
test-08.txt AC 22 ms 3064 KB
test-09.txt AC 23 ms 3064 KB
test-10.txt AC 23 ms 3064 KB
test-11.txt AC 23 ms 3064 KB
test-12.txt AC 23 ms 3064 KB
test-13.txt AC 23 ms 3064 KB
test-14.txt AC 23 ms 3064 KB
test-15.txt AC 23 ms 3064 KB
test-16.txt AC 23 ms 3064 KB
test-17.txt AC 23 ms 3064 KB
test-18.txt AC 24 ms 3064 KB
test-19.txt AC 23 ms 3064 KB
test-20.txt AC 23 ms 3064 KB