제출 #1204593

#제출 시각아이디문제언어결과실행 시간메모리
1204593ofozBigger segments (IZhO19_segments)Pypy 3
0 / 100
133 ms48812 KiB
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()

컴파일 시 표준 출력 (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...