제출 #1344894

#제출 시각아이디문제언어결과실행 시간메모리
1344894maximilianugglaFeast (NOI19_feast)Pypy 3
0 / 100
133 ms134000 KiB
def maxOfKIntervalls(nums: List[int], K: int) -> int:
    lowest = -10**10
    intervalls = []
    maxEnding = 0
    sum = lowest

    for e in nums:
        maxEnding = maxEnding + e
        if maxEnding > sum:
            sum = maxEnding
        if maxEnding < 0:
            intervalls.append(sum)
            sum = lowest
            maxEnding = 0
    
    intervalls.append(sum)
    intervalls.sort(reverse=True)

    res = 0
    interations = min(len(intervalls), K)
    for k in range(interations):
        res = res + intervalls[k]

    if res < 0:
        return 0
    else:
        return res

N, I = map(int, input().split())
numbers = list(map(int, input().split()))
print(maxOfKIntervalls(numbers, I))

컴파일 시 표준 출력 (stdout) 메시지

Compiling 'feast.py'...

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

=======
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...