Submission #6513505

---

Source Code Expand

#!/usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')

#A
def A():
    a, d = LI()
    print(max((a + 1) * d, a * (d + 1)))
    return

#B
def B():
    l, h = LI()
    for _ in range(II()):
        a = II()
        if a > h:
            print(-1)
        elif l <= a <= h:
            print(0)
        else:
            print(l-a)
    return

#C
def C():
    n = II()
    a = LI()
    ans = -inf
    for i in range(n):
        aoki = -inf
        takahashi = -inf
        for k in range(n):
            if i == k:
                continue
            if aoki < sum(a[min(i, k) + 1:max(i, k) + 1:2]):
                aoki = sum(a[min(i, k) + 1:max(i, k) + 1:2])
                takahashi = sum(a[min(i, k):max(i, k) + 1:2])
        ans = max(ans, takahashi)
    print(ans)
    return

#D
def D():
    return

#Solve
if __name__ == '__main__':
    C()

Submission Info

Judge Result