CSES - Aalto Competitive Programming 2024 - wk3 - Mon - Results
Submission details
Task:Maximum sum
Sender:Spot
Submission time:2024-09-16 17:21:04 +0300
Language:PyPy3
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.04 sdetails
#2ACCEPTED0.04 sdetails
#3ACCEPTED0.04 sdetails
#4ACCEPTED0.04 sdetails
#5ACCEPTED0.04 sdetails
#6--details
#7--details
#8--details
#9--details
#10--details
#11ACCEPTED0.04 sdetails
#12ACCEPTED0.04 sdetails
#13ACCEPTED0.04 sdetails
#14ACCEPTED0.04 sdetails
#15ACCEPTED0.04 sdetails

Code

n = int(input())

numList = None
numList = list(map(int, input().split()))

# print("numlist:", numList)

maxSum = numList[0]
for i in range(n):
  currSum = 0
  for j in range(i, n):
    currSum += numList[j]
    maxSum = max(maxSum, currSum)

print(maxSum)

# initialise dp
# dp = [0] * n

# # objective: get max sum in any subarray

# # base cases
# # 1. when array len is 1, then ans is just the int
# # dp[1] = int itself
# dp[1] = numList[0]

# # algorithm
# for i in range(1, n + 1):
#   dp[i] = max(dp[i])

Test details

Test 1

Verdict: ACCEPTED

input
10
1 1 1 1 1 1 1 1 1 1

correct output
10

user output
10

Test 2

Verdict: ACCEPTED

input
10
-1 -1 -1 -1 -1 -1 -1 -1 -1 -1

correct output
-1

user output
-1

Test 3

Verdict: ACCEPTED

input
10
24 7 -27 17 -67 65 -23 58 85 -...

correct output
185

user output
185

Test 4

Verdict: ACCEPTED

input
10
99 -59 31 83 -79 64 -20 -87 40...

correct output
154

user output
154

Test 5

Verdict: ACCEPTED

input
10
-19 61 60 33 67 19 -8 92 59 -3...

correct output
383

user output
383

Test 6

Verdict:

input
200000
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

correct output
200000

user output
(empty)

Test 7

Verdict:

input
200000
-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 ...

correct output
-1

user output
(empty)

Test 8

Verdict:

input
200000
381082742 830199996 -85684827 ...

correct output
231210956017

user output
(empty)

Test 9

Verdict:

input
200000
-935928962 -795492223 75287481...

correct output
184607318819

user output
(empty)

Test 10

Verdict:

input
200000
524408131 613017181 -62281009 ...

correct output
360019999220

user output
(empty)

Test 11

Verdict: ACCEPTED

input
1
1

correct output
1

user output
1

Test 12

Verdict: ACCEPTED

input
1
-2

correct output
-2

user output
-2

Test 13

Verdict: ACCEPTED

input
5
-1 -1 -1 -1 -2

correct output
-1

user output
-1

Test 14

Verdict: ACCEPTED

input
2
-3 -2

correct output
-2

user output
-2

Test 15

Verdict: ACCEPTED

input
1
-1000000000

correct output
-1000000000

user output
-1000000000