Submission #1204296

#TimeUsernameProblemLanguageResultExecution timeMemory
1204296ofozBigger segments (IZhO19_segments)Pypy 3
0 / 100
132 ms48804 KiB
from collections import deque
from sys import setrecursionlimit


def solve():
    n = int(input())
    a = list(map(int, input().split(" ")))
    last = 0
    res = 1
    for i in range(n):
        last += a[i]
        cur = 0
        prv = last
        seg = 1
        for j in range(i+1, n):
            cur += a[j]
            if cur >= prv:
                prv = cur
                cur = 0
                seg += 1
        if cur: seg -= 1
        res = max(res, seg)
    print(res)




"""

"""





solve()

Compilation message (stdout)

Compiling 'segments.py'...

=======
  adding: __main__.pyc (deflated 31%)

=======
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...