Submission #1344900

#TimeUsernameProblemLanguageResultExecution timeMemory
1344900maximilianugglaFeast (NOI19_feast)Pypy 3
22 / 100
175 ms213228 KiB
def maxOfKIntervalls(nums, K: int) -> int:
    lowest = -10**20
    intervalls = []
    maxEnding = 0
    sum = lowest

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

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

    return res


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

Compilation message (stdout)

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