Submission #3236631
Source Code Expand
N = int(input()) inputs = [int(i) for i in input().split()] ao = [] ans = 0 for taka in range(N): res = [- 10 ** 9, - 10 ** 9] for ao in range(N): if ao == taka: pass else: if taka < ao: part = inputs[taka:ao+1] else: part = inputs[ao:taka+1] a = sum(part[::2]) t = sum(part[1::2]) if a > res[1]: res = [t, a] ans = max(ans, res[0]) print(ans)
Submission Info
Submission Time | |
---|---|
Task | C - 数列ゲーム |
User | haytok |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 520 Byte |
Status | WA |
Exec Time | 21 ms |
Memory | 3064 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 100 | ||||||||
Status |
|
|
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 | WA | 17 ms | 3064 KB |
sample-03.txt | WA | 17 ms | 3060 KB |
test-01.txt | WA | 17 ms | 3064 KB |
test-02.txt | AC | 17 ms | 3060 KB |
test-03.txt | WA | 17 ms | 3060 KB |
test-04.txt | WA | 18 ms | 3064 KB |
test-05.txt | AC | 19 ms | 3060 KB |
test-06.txt | WA | 19 ms | 3064 KB |
test-07.txt | AC | 20 ms | 3060 KB |
test-08.txt | AC | 20 ms | 3064 KB |
test-09.txt | AC | 20 ms | 3060 KB |
test-10.txt | WA | 20 ms | 3064 KB |
test-11.txt | AC | 20 ms | 3060 KB |
test-12.txt | AC | 20 ms | 3060 KB |
test-13.txt | WA | 20 ms | 3060 KB |
test-14.txt | AC | 20 ms | 3064 KB |
test-15.txt | AC | 20 ms | 3064 KB |
test-16.txt | WA | 20 ms | 3060 KB |
test-17.txt | AC | 20 ms | 3064 KB |
test-18.txt | AC | 20 ms | 3060 KB |
test-19.txt | AC | 21 ms | 3064 KB |
test-20.txt | WA | 20 ms | 3064 KB |