# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1204296 | ofoz | Bigger segments (IZhO19_segments) | Pypy 3 | 132 ms | 48804 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()
컴파일 시 표준 출력 (stdout) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |