Submission #1204593

#	Time	Username	Problem	Language	Result	Execution time	Memory
1204593		ofoz	Bigger segments (IZhO19_segments)	Pypy 3	0 / 100	133 ms	48812 KiB

segments

from collections import deque
from sys import setrecursionlimit


def solve():
    n = int(input())
    a = list(map(int, input().split(" ")))
    cur = deque()
    s = 0
    prv = 0
    res = 0
    for i in range(n):
        s += a[i]
        cur.append(a[i])
        if s < prv: continue
        res += 1
        while cur and (s - cur[0]) >= (prv + cur[0]):
            p = cur.popleft()
            prv += p
            s -= p
            
        prv = s
        cur.clear()
        s = 0

        
    print(res)
        








solve()

Compilation message (stdout)

Compiling 'segments.py'...

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

=======

• Subtask 1: 0 / 13
• Subtask 2: 0 / 14
• Subtask 3: 0 / 10
• Subtask 4: 0 / 36
• Subtask 5: 0 / 27