Tasks Details
medium
Find the maximal sum of any double slice.
Task Score
100%
Correctness
100%
Performance
100%
A non-empty array A consisting of N integers is given.
A triplet (X, Y, Z), such that 0 ≤ X < Y < Z < N, is called a double slice.
The sum of double slice (X, Y, Z) is the total of A[X + 1] + A[X + 2] + ... + A[Y − 1] + A[Y + 1] + A[Y + 2] + ... + A[Z − 1].
For example, array A such that:
A[0] = 3 A[1] = 2 A[2] = 6 A[3] = -1 A[4] = 4 A[5] = 5 A[6] = -1 A[7] = 2contains the following example double slices:
- double slice (0, 3, 6), sum is 2 + 6 + 4 + 5 = 17,
- double slice (0, 3, 7), sum is 2 + 6 + 4 + 5 − 1 = 16,
- double slice (3, 4, 5), sum is 0.
The goal is to find the maximal sum of any double slice.
Write a function:
def solution(A)
that, given a non-empty array A consisting of N integers, returns the maximal sum of any double slice.
For example, given:
A[0] = 3 A[1] = 2 A[2] = 6 A[3] = -1 A[4] = 4 A[5] = 5 A[6] = -1 A[7] = 2the function should return 17, because no double slice of array A has a sum of greater than 17.
Write an efficient algorithm for the following assumptions:
- N is an integer within the range [3..100,000];
- each element of array A is an integer within the range [−10,000..10,000].
Copyright 2009–2025 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used Python
Time spent on task 71 minutes
Notes
not defined yet
Code: 10:00:49 UTC,
java,
autosave
Code: 10:00:59 UTC,
py,
autosave
Code: 10:01:20 UTC,
py,
verify,
result: Failed
Analysis
expand all
Example tests
1.
0.036 s
WRONG ANSWER,
got 20 expected 17
stdout:
[3, 2, 6, -1, 4, 5, -1, 2] <list_reverseiterator object at 0x2b590bd29da0>
Code: 10:01:32 UTC,
py,
autosave
Code: 10:01:37 UTC,
py,
verify,
result: Failed
Analysis
expand all
Example tests
1.
0.036 s
WRONG ANSWER,
got 20 expected 17
stdout:
[3, 2, 6, -1, 4, 5, -1, 2] [2, -1, 5, 4, -1, 6, 2, 3]
Code: 10:01:52 UTC,
py,
autosave
Code: 10:02:19 UTC,
py,
autosave
Code: 10:02:35 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
i = 0
max_ending = max_slice[i] = A[i]
for a in A[1:]:
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
print(A)
print(list(reversed(A)))
return max_slice
Code: 10:02:45 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
i = 0
max_ending = max_slice[i] = A[i]
for a in A[1:]:
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
print(A)
print(list(reversed(A)))
return max_slice
Code: 10:02:57 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
i = 0
max_ending = max_slice[i] = A[i]
for a in A[1:]:
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
print(A)
print(list(reversed(A)))
return max_slice
Code: 10:03:07 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
i = 0
max_ending = max_slice[0] = A[0]
for a in A[1:]:
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
print(A)
print(list(reversed(A)))
return max_slice
Code: 10:03:35 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
i = 0
max_ending = max_slice = A[0]
max_slices_forward[0] = max_slice
for a in A[1:]:
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
print(A)
print(list(reversed(A)))
return max_slice
Code: 10:03:39 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
i = 0
max_ending = max_slice = A[0]
max_slices_forward[0] = max_slice
for a in A[1:]:
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
print(A)
print(list(reversed(A)))
return max_slice
Code: 10:03:58 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
i = 0
max_ending = max_slice = A[0]
max_slices_forward[0] = max_slice
for a in A[1:]:
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
max_slices_forward[0] = max_slice
print(A)
print(list(reversed(A)))
return max_slice
Code: 10:04:10 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
i = 0
max_ending = max_slice = A[0]
max_slices_forward[0] = max_slice
for a in A[1:]:
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
i =
max_slices_forward[0] = max_slice
print(A)
print(list(reversed(A)))
return max_slice
Code: 10:04:32 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
i = 0
max_ending = max_slice = A[0]
max_slices_forward[0] = max_slice
for i,a in enumerate(A[1:]):
print(i)
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
max_slices_forward[0] = max_slice
print(A)
print(list(reversed(A)))
return max_slice
Analysis
expand all
Example tests
1.
0.040 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 129, in <module>
main()
File "exec.py", line 91, in main
result = solution( A )
File "/tmp/solution.py", line 7, in solution
max_slices_forward[0] = max_slice
NameError: name 'max_slices_forward' is not defined
Code: 10:04:50 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
i = 0
max_ending = max_slice = A[0]
max_slices_forward[0] = max_slice
for i,a in enumerate(A[1:]):
print(i)
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
max_slices_forward[0] = max_slice
print(A)
print(list(reversed(A)))
return max_slice
Code: 10:04:52 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
i = 0
max_ending = max_slice = A[0]
max_slices_forward = []
max_slices_forward[0] = max_slice
for i,a in enumerate(A[1:]):
print(i)
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
max_slices_forward[0] = max_slice
print(A)
print(list(reversed(A)))
return max_slice
Code: 10:04:53 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
i = 0
max_ending = max_slice = A[0]
max_slices_forward = []
max_slices_forward[0] = max_slice
for i,a in enumerate(A[1:]):
print(i)
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
max_slices_forward[0] = max_slice
print(A)
print(list(reversed(A)))
return max_slice
Analysis
expand all
Example tests
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 129, in <module>
main()
File "exec.py", line 91, in main
result = solution( A )
File "/tmp/solution.py", line 8, in solution
max_slices_forward[0] = max_slice
IndexError: list assignment index out of range
Code: 10:05:20 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
i = 0
max_ending = max_slice = A[0]
max_slices_forward = []
max_slices_forward.append( = max_slice
for i,a in enumerate(A[1:]):
print(i)
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
max_slices_forward[0] = max_slice
print(A)
print(list(reversed(A)))
return max_slice
Code: 10:05:25 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
i = 0
max_ending = max_slice = A[0]
max_slices_forward = []
max_slices_forward.append(max_slice)
for i,a in enumerate(A[1:]):
print(i)
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
max_slices_forward[0] = max_slice
print(A)
print(list(reversed(A)))
return max_slice
Analysis
expand all
Example tests
1.
0.036 s
WRONG ANSWER,
got 20 expected 17
stdout:
0 1 2 3 4 5 6 [3, 2, 6, -1, 4, 5, -1, 2] [2, -1, 5, 4, -1, 6, 2, 3]
Code: 10:05:39 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
i = 0
max_ending = max_slice = A[0]
max_slices_forward = []
max_slices_forward.append(max_slice)
for i,a in enumerate(A[1:]):
print(i)
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
max_slices_forward.append(max_slice)
print(A)
print(list(reversed(A)))
return max_slice
Analysis
expand all
Example tests
1.
0.036 s
WRONG ANSWER,
got 20 expected 17
stdout:
0 1 2 3 4 5 6 [3, 2, 6, -1, 4, 5, -1, 2] [2, -1, 5, 4, -1, 6, 2, 3]
Code: 10:05:47 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
i = 0
max_ending = max_slice = A[0]
max_slices_forward = []
max_slices_forward.append(max_slice)
for i,a in enumerate(A[1:]):
print(i)
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
max_slices_forward.append(max_slice)
max_slices_forward
print(A)
print(list(reversed(A)))
return max_slice
Code: 10:05:55 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
i = 0
max_ending = max_slice = A[0]
max_slices_forward = []
max_slices_forward.append(max_slice)
for i,a in enumerate(A[1:]):
print(i)
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
max_slices_forward.append(max_slice)
print(max_slices_forward)
print(A)
print(list(reversed(A)))
return max_slice
Analysis
expand all
Example tests
1.
0.036 s
WRONG ANSWER,
got 20 expected 17
stdout:
0 1 2 3 4 5 6 [3, 5, 11, 11, 14, 19, 19, 20] [3, 2, 6, -1, 4, 5, -1, 2] [2, -1, 5, 4, -1, 6, 2, 3]
Code: 10:06:13 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
i = 0
max_ending = max_slice = A[0]
max_slices_forward = []
max_slices_forward.append(max_slice)
for i,a in enumerate(A[1:]):
print(i)
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
max_slices_forward.append(max_slice)
print(max_slices_forward)
print(A)
print(list(reversed(A)))
return max_slice
Code: 10:06:24 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
max_ending = max_slice = A[0]
max_slices_forward = []
max_slices_forward.append(max_slice)
for i,a in enumerate(A[1:]):
print(i)
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
max_slices_forward.append(max_slice)
print(max_slices_forward)
print(A)
print(list(reversed(A)))
return max_slice
Code: 10:06:44 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
max_ending = max_slice = A[0]
max_slices_forward = []
max_slices_forward.append(max_slice)
for i,a in enumerate(A[1:]):
print(i)
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
max_slices_forward.append(max_slice)
A =
print(max_slices_forward)
print(A)
print(list(reversed(A)))
return max_slice
Code: 10:07:00 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
max_ending = max_slice = A[0]
max_slices_forward = []
max_slices_forward.append(max_slice)
for i,a in enumerate(A[1:]):
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
max_slices_forward.append(max_slice)
A = list(reversed(A))
print(max_slices_forward)
print(A)
print(list(reversed(A)))
return max_slice
Code: 10:07:13 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
max_ending = max_slice = A[0]
max_slices_forward = []
max_slices_forward.append(max_slice)
for a in A[1:]:
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
max_slices_forward.append(max_slice)
A = list(reversed(A))
max_ending = max_slice = A[0]
max_slices_forward = []
max_slices_forward.append(max_slice)
for a in A[1:]:
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
max_slices_forward.append(max_slice)
print(max_slices_forward)
print(A)
print(list(reversed(A)))
return max_slice
Code: 10:07:18 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
max_ending = max_slice = A[0]
max_slices_forward = []
max_slices_forward.append(max_slice)
for a in A[1:]:
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
max_slices_forward.append(max_slice)
A = list(reversed(A))
max_ending = max_slice = A[0]
max_slices_forward = []
max_slices_forward.append(max_slice)
for a in A[1:]:
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
max_slices_forward.append(max_slice)
print(max_slices_forward)
print(A)
print(list(reversed(A)))
return max_slice
Code: 10:07:22 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
max_ending = max_slice = A[0]
max_slices_forward = []
max_slices_forward.append(max_slice)
for a in A[1:]:
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
max_slices_forward.append(max_slice)
A = list(reversed(A))
max_ending = max_slice = A[0]
max_slices_backwards = []
max_slices_forward.append(max_slice)
for a in A[1:]:
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
max_slices_forward.append(max_slice)
print(max_slices_forward)
print(A)
print(list(reversed(A)))
return max_slice
Code: 10:07:29 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
max_ending = max_slice = A[0]
max_slices_forward = []
max_slices_forward.append(max_slice)
for a in A[1:]:
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
max_slices_forward.append(max_slice)
A = list(reversed(A))
max_ending = max_slice = A[0]
max_slices_backwards = []
max_slices_backwards.append(max_slice)
for a in A[1:]:
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
max_slices_backwards.append(max_slice)
print(max_slices_forward)
print(A)
print(list(reversed(A)))
return max_slice
Code: 10:07:39 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
max_ending = max_slice = A[0]
max_slices_forward = []
max_slices_forward.append(max_slice)
for a in A[1:]:
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
max_slices_forward.append(max_slice)
A = list(reversed(A))
max_ending = max_slice = A[0]
max_slices_backwards = []
max_slices_backwards.append(max_slice)
for a in A[1:]:
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
max_slices_backwards.append(max_slice)
print(max_slices_forward)
print(A)
print(list(reversed(A)))
return max_slice
Analysis
expand all
Example tests
1.
0.036 s
WRONG ANSWER,
got 20 expected 17
stdout:
[3, 5, 11, 11, 14, 19, 19, 20] [2, -1, 5, 4, -1, 6, 2, 3] [3, 2, 6, -1, 4, 5, -1, 2]
Code: 10:07:49 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
max_ending = max_slice = A[0]
max_slices_forward = []
max_slices_forward.append(max_slice)
for a in A[1:]:
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
max_slices_forward.append(max_slice)
A = list(reversed(A))
max_ending = max_slice = A[0]
max_slices_backwards = []
max_slices_backwards.append(max_slice)
for a in A[1:]:
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
max_slices_backwards.append(max_slice)
print(max_slices_forward)
print(max_slices_backwards)
print(A)
print(list(reversed(A)))
return max_slice
Analysis
expand all
Example tests
1.
0.048 s
WRONG ANSWER,
got 20 expected 17
stdout:
[3, 5, 11, 11, 14, 19, 19, 20] [2, 2, 6, 10, 10, 15, 17, 20] [2, -1, 5, 4, -1, 6, 2, 3] [3, 2, 6, -1, 4, 5, -1, 2]
Code: 10:08:07 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
max_ending = max_slice = A[0]
max_slices_forward = []
max_slices_forward.append(max_slice)
for a in A[1:]:
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
max_slices_forward.append(max_slice)
A = list(reversed(A))
max_ending = max_slice = A[0]
max_slices_backwards = []
max_slices_backwards.append(max_slice)
for a in A[1:]:
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
max_slices_backwards.append(max_slice)
print(max_slices_forward)
print(max_slices_backwards)
print(A)
print(list(reversed(A)))
return max_slice
Code: 10:08:22 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
max_ending = max_slice = A[0]
max_slices_forward = []
max_slices_forward.append(max_slice)
for a in A[1:]:
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
max_slices_forward.append(max_slice)
A = list(reversed(A))
max_ending = max_slice = A[0]
max_slices_backwards = []
max_slices_backwards.append(max_slice)
for a in A[1:]:
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
max_slices_backwards.append(max_slice)
for i in range(for a in A[1:]:)
print(max_slices_forward)
print(max_slices_backwards)
print(A)
print(list(reversed(A)))
return max_slice
Code: 10:08:24 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
max_ending = max_slice = A[0]
max_slices_forward = []
max_slices_forward.append(max_slice)
for a in A[1:]:
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
max_slices_forward.append(max_slice)
A = list(reversed(A))
max_ending = max_slice = A[0]
max_slices_backwards = []
max_slices_backwards.append(max_slice)
for a in A[1:]:
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
max_slices_backwards.append(max_slice)
for i in range(A)
print(max_slices_forward)
print(max_slices_backwards)
print(A)
print(list(reversed(A)))
return max_slice
Code: 10:08:33 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
max_ending = max_slice = A[0]
max_slices_forward = []
max_slices_forward.append(max_slice)
for a in A[1:]:
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
max_slices_forward.append(max_slice)
A = list(reversed(A))
max_ending = max_slice = A[0]
max_slices_backwards = []
max_slices_backwards.append(max_slice)
for a in A[1:]:
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
max_slices_backwards.append(max_slice)
for i in range(A):
for a in A[1:]:
print(max_slices_forward)
print(max_slices_backwards)
print(A)
print(list(reversed(A)))
return max_slice
Code: 10:08:45 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
max_ending = max_slice = A[0]
max_slices_forward = []
max_slices_forward.append(max_slice)
for a in A[1:]:
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
max_slices_forward.append(max_slice)
A = list(reversed(A))
max_ending = max_slice = A[0]
max_slices_backwards = []
max_slices_backwards.append(max_slice)
for a in A[1:]:
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
max_slices_backwards.append(max_slice)
for i in range(A):
print(max_slices_forward[i])
print(max_slices_backwards[i])
print(max_slices_forward)
print(max_slices_backwards)
print(A)
print(list(reversed(A)))
return max_slice
Code: 10:08:58 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
max_ending = max_slice = A[0]
max_slices_forward = []
max_slices_forward.append(max_slice)
for a in A[1:]:
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
max_slices_forward.append(max_slice)
A = list(reversed(A))
max_ending = max_slice = A[0]
max_slices_backwards = []
max_slices_backwards.append(max_slice)
for a in A[1:]:
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
max_slices_backwards.append(max_slice)
for i in range(A):
print(max_slices_forward[i+1])
print(max_slices_backwards[i-1])
print(max_slices_forward)
print(max_slices_backwards)
print(A)
print(list(reversed(A)))
return max_slice
Code: 10:09:12 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
max_ending = max_slice = A[0]
max_slices_forward = []
max_slices_forward.append(max_slice)
for a in A[1:]:
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
max_slices_forward.append(max_slice)
A = list(reversed(A))
max_ending = max_slice = A[0]
max_slices_backwards = []
max_slices_backwards.append(max_slice)
for a in A[1:]:
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
max_slices_backwards.append(max_slice)
for i in range(A):
print(max_slices_forward[i+1])
print(max_slices_backwards[i-1])
print(max_slices_forward[i+1] + max_slices_backwards[i-1])
print(max_slices_forward)
print(max_slices_backwards)
print(A)
print(list(reversed(A)))
return max_slice
Code: 10:09:13 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
max_ending = max_slice = A[0]
max_slices_forward = []
max_slices_forward.append(max_slice)
for a in A[1:]:
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
max_slices_forward.append(max_slice)
A = list(reversed(A))
max_ending = max_slice = A[0]
max_slices_backwards = []
max_slices_backwards.append(max_slice)
for a in A[1:]:
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
max_slices_backwards.append(max_slice)
for i in range(A):
print(max_slices_forward[i+1])
print(max_slices_backwards[i-1])
print(max_slices_forward[i+1] + max_slices_backwards[i-1])
print(max_slices_forward)
print(max_slices_backwards)
print(A)
print(list(reversed(A)))
return max_slice
Analysis
expand all
Example tests
1.
0.040 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 129, in <module>
main()
File "exec.py", line 91, in main
result = solution( A )
File "/tmp/solution.py", line 23, in solution
for i in range(A):
TypeError: 'list' object cannot be interpreted as an integer
Code: 10:09:44 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
max_ending = max_slice = A[0]
max_slices_forward = []
max_slices_forward.append(max_slice)
for a in A[1:]:
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
max_slices_forward.append(max_slice)
A = list(reversed(A))
max_ending = max_slice = A[0]
max_slices_backwards = []
max_slices_backwards.append(max_slice)
for a in A[1:]:
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
max_slices_backwards.append(max_slice)
for i in range(lenA):
print(max_slices_forward[i+1])
print(max_slices_backwards[i-1])
print(max_slices_forward[i+1] + max_slices_backwards[i-1])
print(max_slices_forward)
print(max_slices_backwards)
print(A)
print(list(reversed(A)))
return max_slice
Code: 10:09:47 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
max_ending = max_slice = A[0]
max_slices_forward = []
max_slices_forward.append(max_slice)
for a in A[1:]:
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
max_slices_forward.append(max_slice)
A = list(reversed(A))
max_ending = max_slice = A[0]
max_slices_backwards = []
max_slices_backwards.append(max_slice)
for a in A[1:]:
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
max_slices_backwards.append(max_slice)
for i in range(len(A)):
print(max_slices_forward[i+1])
print(max_slices_backwards[i-1])
print(max_slices_forward[i+1] + max_slices_backwards[i-1])
print(max_slices_forward)
print(max_slices_backwards)
print(A)
print(list(reversed(A)))
return max_slice
Analysis
expand all
Example tests
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 129, in <module>
main()
File "exec.py", line 91, in main
result = solution( A )
File "/tmp/solution.py", line 24, in solution
print(max_slices_forward[i+1])
IndexError: list index out of range
stdout:
5 20 25 11 2 13 11 2 13 14 6 20 19 10 29 19 10 29 20 15 35
Code: 10:10:00 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
max_ending = max_slice = A[0]
max_slices_forward = []
max_slices_forward.append(max_slice)
for a in A[1:]:
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
max_slices_forward.append(max_slice)
A = list(reversed(A))
max_ending = max_slice = A[0]
max_slices_backwards = []
max_slices_backwards.append(max_slice)
for a in A[1:]:
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
max_slices_backwards.append(max_slice)
for i in range(len(A)):
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(max_slices_forward[i+1] + max_slices_backwards[i-1])
print(max_slices_forward)
print(max_slices_backwards)
print(A)
print(list(reversed(A)))
return max_slice
Analysis
expand all
Example tests
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 129, in <module>
main()
File "exec.py", line 91, in main
result = solution( A )
File "/tmp/solution.py", line 26, in solution
print(max_slices_forward[i+1] + max_slices_backwards[i-1])
IndexError: list index out of range
stdout:
25 13 13 20 29 29 35
Code: 10:13:31 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
max_ending = max_slice = A[0]
max_slices_forward = []
max_slices_forward.append(max_slice)
for a in A[1:]:
max_ending = max(,max_ending + a)
max_slice = max(max_slice, max_ending)
max_slices_forward.append(max_slice)
A = list(reversed(A))
max_ending = max_slice = A[0]
max_slices_backwards = []
max_slices_backwards.append(max_slice)
for a in A[1:]:
max_ending = max(a,max_ending + a)
max_slice = max(max_slice, max_ending)
max_slices_backwards.append(max_slice)
for i in range(len(A)):
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(max_slices_forward[i+1] + max_slices_backwards[i-1])
print(max_slices_forward)
print(max_slices_backwards)
print(A)
print(list(reversed(A)))
return max_slice
Code: 10:13:42 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
max_ending = max_slice = A[0]
max_slices_forward = []
max_slices_forward.append(max_slice)
for a in A[1:]:
max_ending = max(0,max_ending + a)
#max_slice = max(max_slice, max_ending)
max_slices_forward.append(max_ending)
A = list(reversed(A))
max_ending = max_slice = A[0]
max_slices_backwards = []
max_slices_backwards.append(max_slice)
for a in A[1:]:
max_ending = max(0,max_ending + a)
max_slice = max(max_slice, max_ending)
max_slices_backwards.append(max_slice)
for i in range(len(A)):
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(max_slices_forward[i+1] + max_slices_backwards[i-1])
print(max_slices_forward)
print(max_slices_backwards)
print(A)
print(list(reversed(A)))
return max_slice
Code: 10:13:46 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
max_ending = max_slice = A[0]
max_slices_forward = []
max_slices_forward.append(max_slice)
for a in A[1:]:
max_ending = max(0,max_ending + a)
#max_slice = max(max_slice, max_ending)
max_slices_forward.append(max_ending)
A = list(reversed(A))
max_ending = max_slice = A[0]
max_slices_backwards = []
max_slices_backwards.append(max_slice)
for a in A[1:]:
max_ending = max(0,max_ending + a)
#max_slice = max(max_slice, max_ending)
max_slices_backwards.append(max_ending)
for i in range(len(A)):
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(max_slices_forward[i+1] + max_slices_backwards[i-1])
print(max_slices_forward)
print(max_slices_backwards)
print(A)
print(list(reversed(A)))
return max_slice
Code: 10:14:05 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
max_ending = max_slice = A[0]
max_slices_forward = []
max_slices_forward.append(max_slice)
for a in A[1:]:
max_ending = max(0,max_ending + a)
#max_slice = max(max_slice, max_ending)
max_slices_forward.append(max_ending)
A = list(reversed(A))
max_ending = max_slice = A[0]
max_slices_backwards = []
max_slices_backwards.append(max_slice)
for a in A[1:]:
max_ending = max(0,max_ending + a)
#max_slice = max(max_slice, max_ending)
max_slices_backwards.append(max_ending)
for i in range(len(A)):
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(max_slices_forward[i+1] + max_slices_backwards[i-1])
print(max_slices_forward)
print(max_slices_backwards)
print(A)
print(list(reversed(A)))
return max_slice
Analysis
expand all
Example tests
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 129, in <module>
main()
File "exec.py", line 91, in main
result = solution( A )
File "/tmp/solution.py", line 26, in solution
print(max_slices_forward[i+1] + max_slices_backwards[i-1])
IndexError: list index out of range
stdout:
25 13 11 20 29 27 35
Code: 10:15:38 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
max_ending = max_slice = A[0]
max_slices_forward = []
max_slices_forward.append(max_slice)
for a in A[1:]:
max_ending = max(0max_ending + a)
#max_slice = max(max_slice, max_ending)
max_slices_forward.append(max_ending)
A = list(reversed(A))
max_ending = max_slice = A[0]
max_slices_backwards = []
max_slices_backwards.append(max_slice)
for a in A[1:]:
max_ending = max(0,max_ending + a)
#max_slice = max(max_slice, max_ending)
max_slices_backwards.append(max_ending)
for i in range(len(A)):
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(max_slices_forward[i+1] + max_slices_backwards[i-1])
print(max_slices_forward)
print(max_slices_backwards)
print(A)
print(list(reversed(A)))
return max_slice
Code: 10:15:48 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
max_ending = max_slice = A[0]
max_slices_forward = []
max_slices_forward.append(max_slice)
for a in A[1:]:
ending = max_ending + a)
#max_slice = max(max_slice, max_ending)
max_slices_forward.append(max_ending)
A = list(reversed(A))
max_ending = max_slice = A[0]
max_slices_backwards = []
max_slices_backwards.append(max_slice)
for a in A[1:]:
max_ending = max(0,max_ending + a)
#max_slice = max(max_slice, max_ending)
max_slices_backwards.append(max_ending)
for i in range(len(A)):
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(max_slices_forward[i+1] + max_slices_backwards[i-1])
print(max_slices_forward)
print(max_slices_backwards)
print(A)
print(list(reversed(A)))
return max_slice
Code: 10:15:50 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
max_ending = max_slice = A[0]
max_slices_forward = []
max_slices_forward.append(max_slice)
for a in A[1:]:
ending = ending + a
#max_slice = max(max_slice, max_ending)
max_slices_forward.append(max_ending)
A = list(reversed(A))
max_ending = max_slice = A[0]
max_slices_backwards = []
max_slices_backwards.append(max_slice)
for a in A[1:]:
max_ending = max(0,max_ending + a)
#max_slice = max(max_slice, max_ending)
max_slices_backwards.append(max_ending)
for i in range(len(A)):
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(max_slices_forward[i+1] + max_slices_backwards[i-1])
print(max_slices_forward)
print(max_slices_backwards)
print(A)
print(list(reversed(A)))
return max_slice
Code: 10:16:18 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
max_ending = max_slice = A[0]
max_slices_forward = []
max_slices_forward.append(max_slice)
for a in A[1:]:
ending = max(0, ending + a
#max_slice = max(max_slice, max_ending)
max_slices_forward.append(max_ending)
A = list(reversed(A))
max_ending = max_slice = A[0]
max_slices_backwards = []
max_slices_backwards.append(max_slice)
for a in A[1:]:
max_ending = max(0,max_ending + a)
#max_slice = max(max_slice, max_ending)
max_slices_backwards.append(max_ending)
for i in range(len(A)):
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(max_slices_forward[i+1] + max_slices_backwards[i-1])
print(max_slices_forward)
print(max_slices_backwards)
print(A)
print(list(reversed(A)))
return max_slice
Code: 10:16:28 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
max_ending = max_slice = A[0]
max_slices_forward = []
max_slices_forward.append(max_slice)
for a in A[1:]:
ending = max(0, ending + a)
#max_slice = max(max_slice, max_ending)
max_slices_forward.append(max_ending)
A = list(reversed(A))
max_ending = max_slice = A[0]
max_slices_backwards = []
max_slices_backwards.append(max_slice)
for a in A[1:]:
max_ending = max(0,max_ending + a)
#max_slice = max(max_slice, max_ending)
max_slices_backwards.append(max_ending)
for i in range(len(A)):
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(max_slices_forward[i+1] + max_slices_backwards[i-1])
print(max_slices_forward)
print(max_slices_backwards)
print(A)
print(list(reversed(A)))
return max_slice
Code: 10:16:38 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
max_ending = max_slice = A[0]
max_slices_forward = []
max_slices_forward.append(max_slice)
for a in A[1:]:
ending = max(0, ending + a)
#max_slice = max(max_slice, max_ending)
max_slices_forward.append(ending)
A = list(reversed(A))
max_ending = max_slice = A[0]
max_slices_backwards = []
max_slices_backwards.append(max_slice)
for a in A[1:]:
max_ending = max(0,max_ending + a)
#max_slice = max(max_slice, max_ending)
max_slices_backwards.append(max_ending)
for i in range(len(A)):
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(max_slices_forward[i+1] + max_slices_backwards[i-1])
print(max_slices_forward)
print(max_slices_backwards)
print(A)
print(list(reversed(A)))
return max_slice
Code: 10:17:43 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
max_ending = max_slice = A[0]
max_slices_forward = []
max_slices_forward.append(max_slice)
for a in A[1:]:
ending = max(0, ending + a)
#max_slice = max(max_slice, max_ending)
max_slices_forward.append(ending)
A = list(reversed(A))
max_ending = max_slice = A[0]
max_slices_backwards = []
max_slices_backwards.append(max_slice)
for a in A[1:]:
max_ending = max(0,max_ending + a)
#max_slice = max(max_slice, max_ending)
max_slices_backwards.append(max_ending)
for i in range(len(A)-):
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(max_slices_forward[i+1] + max_slices_backwards[i-1])
print(max_slices_forward)
print(max_slices_backwards)
print(A)
print(list(reversed(A)))
return max_slice
Code: 10:17:56 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
max_ending = max_slice = A[0]
max_slices_forward = []
max_slices_forward.append(max_slice)
for a in A[1:]:
ending = max(0, ending + a)
#max_slice = max(max_slice, max_ending)
max_slices_forward.append(ending)
A = list(reversed(A))
max_ending = max_slice = A[0]
max_slices_backwards = []
max_slices_backwards.append(max_slice)
for a in A[1:]:
max_ending = max(0,max_ending + a)
#max_slice = max(max_slice, max_ending)
max_slices_backwards.append(max_ending)
for i in range(1,len(A)-2):
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(max_slices_forward[i+1] + max_slices_backwards[i-1])
print(max_slices_forward)
print(max_slices_backwards)
print(A)
print(list(reversed(A)))
return max_slice
Analysis
expand all
Example tests
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 129, in <module>
main()
File "exec.py", line 91, in main
result = solution( A )
File "/tmp/solution.py", line 9, in solution
ending = max(0, ending + a)
UnboundLocalError: local variable 'ending' referenced before assignment
Code: 10:18:13 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
max_ending = max_slice = A[0]
max_slices_forward = []
max_slices_forward.append(max_slice)
for a in A[1:]:
ending = max(0, ending + a)
#max_slice = max(max_slice, max_ending)
max_slices_forward.append(ending)
A = list(reversed(A))
max_ending = max_slice = A[0]
max_slices_backwards = []
max_slices_backwards.append(max_slice)
for a in A[1:]:
ending = max(0, ending + a)
#max_slice = max(max_slice, max_ending)
max_slices_backwards.append(ending)
for i in range(1,len(A)-2):
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(max_slices_forward[i+1] + max_slices_backwards[i-1])
print(max_slices_forward)
print(max_slices_backwards)
print(A)
print(list(reversed(A)))
return max_slice
Code: 10:18:16 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
max_ending = max_slice = A[0]
max_slices_forward = []
max_slices_forward.append(max_slice)
for a in A[1:]:
ending = max(0, ending + a)
#max_slice = max(max_slice, max_ending)
max_slices_forward.append(ending)
A = list(reversed(A))
max_ending = max_slice = A[0]
max_slices_backwards = []
max_slices_backwards.append(max_slice)
for a in A[1:]:
ending = max(0, ending + a)
#max_slice = max(max_slice, max_ending)
max_slices_backwards.append(ending)
for i in range(1,len(A)-2):
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(max_slices_forward[i+1] + max_slices_backwards[i-1])
print(max_slices_forward)
print(max_slices_backwards)
print(A)
print(list(reversed(A)))
return max_slice
Analysis
expand all
Example tests
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 129, in <module>
main()
File "exec.py", line 91, in main
result = solution( A )
File "/tmp/solution.py", line 9, in solution
ending = max(0, ending + a)
UnboundLocalError: local variable 'ending' referenced before assignment
Code: 10:18:24 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = max_slice = A[0]
max_slices_forward = []
max_slices_forward.append(max_slice)
for a in A[1:]:
ending = max(0, ending + a)
#max_slice = max(max_slice, max_ending)
max_slices_forward.append(ending)
A = list(reversed(A))
max_ending = max_slice = A[0]
max_slices_backwards = []
max_slices_backwards.append(max_slice)
for a in A[1:]:
ending = max(0, ending + a)
#max_slice = max(max_slice, max_ending)
max_slices_backwards.append(ending)
for i in range(1,len(A)-2):
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(max_slices_forward[i+1] + max_slices_backwards[i-1])
print(max_slices_forward)
print(max_slices_backwards)
print(A)
print(list(reversed(A)))
return max_slice
Code: 10:18:28 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = max_slice = A[0]
max_slices_forward = []
max_slices_forward.append(max_slice)
for a in A[1:]:
ending = max(0, ending + a)
#max_slice = max(max_slice, max_ending)
max_slices_forward.append(ending)
A = list(reversed(A))
ending = max_slice = A[0]
max_slices_backwards = []
max_slices_backwards.append(max_slice)
for a in A[1:]:
ending = max(0, ending + a)
#max_slice = max(max_slice, max_ending)
max_slices_backwards.append(ending)
for i in range(1,len(A)-2):
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(max_slices_forward[i+1] + max_slices_backwards[i-1])
print(max_slices_forward)
print(max_slices_backwards)
print(A)
print(list(reversed(A)))
return max_slice
Analysis
expand all
Example tests
1.
0.036 s
WRONG ANSWER,
got 2 expected 17
stdout:
13 11 20 29 27 [3, 5, 11, 10, 14, 19, 18, 20] [2, 1, 6, 10, 9, 15, 17, 20] [2, -1, 5, 4, -1, 6, 2, 3] [3, 2, 6, -1, 4, 5, -1, 2]
Code: 10:19:36 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = max_slice = A[0]
max_slices_forward = []
max_slices_forward.append(max_slice)
for a in A[1:]:
ending = max(0, ending + a)
#max_slice = max(max_slice, max_ending)
max_slices_forward.append(ending)
A = list(reversed(A))
ending = max_slice = A[]
max_slices_backwards = []
max_slices_backwards.append(max_slice)
for a in A[1:]:
ending = max(0, ending + a)
#max_slice = max(max_slice, max_ending)
max_slices_backwards.append(ending)
for i in range(1,len(A)-2):
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(max_slices_forward[i+1] + max_slices_backwards[i-1])
print(max_slices_forward)
print(max_slices_backwards)
print(A)
print(list(reversed(A)))
return max_slice
Code: 10:19:46 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = max_slice = A[0]
max_slices_forward = []
max_slices_forward.append(max_slice)
for a in A[1:]:
ending = max(0, ending + a)
#max_slice = max(max_slice, max_ending)
max_slices_forward.append(ending)
A = list(reversed(A))
ending = max_slice = A[1]
max_slices_backwards = []
max_slices_backwards.append(max_slice)
for a in A[2:]:
ending = max(0, ending + a)
#max_slice = max(max_slice, max_ending)
max_slices_backwards.append(ending)
for i in range(1,len(A)-2):
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(max_slices_forward[i+1] + max_slices_backwards[i-1])
print(max_slices_forward)
print(max_slices_backwards)
print(A)
print(list(reversed(A)))
return max_slice
Code: 10:19:50 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = max_slice = A[1]
max_slices_forward = []
max_slices_forward.append(max_slice)
for a in A[2:]:
ending = max(0, ending + a)
#max_slice = max(max_slice, max_ending)
max_slices_forward.append(ending)
A = list(reversed(A))
ending = max_slice = A[1]
max_slices_backwards = []
max_slices_backwards.append(max_slice)
for a in A[2:]:
ending = max(0, ending + a)
#max_slice = max(max_slice, max_ending)
max_slices_backwards.append(ending)
for i in range(1,len(A)-2):
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(max_slices_forward[i+1] + max_slices_backwards[i-1])
print(max_slices_forward)
print(max_slices_backwards)
print(A)
print(list(reversed(A)))
return max_slice
Analysis
expand all
Example tests
1.
0.036 s
WRONG ANSWER,
got -1 expected 17
stdout:
6 15 24 22 30 [2, 8, 7, 11, 16, 15, 17] [-1, 4, 8, 7, 13, 15, 18] [2, -1, 5, 4, -1, 6, 2, 3] [3, 2, 6, -1, 4, 5, -1, 2]
Code: 10:20:10 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = A[1]
max_slices_forward = []
max_slices_forward.append(max_slice)
for a in A[2:]:
ending = max(0, ending + a)
#max_slice = max(max_slice, max_ending)
max_slices_forward.append(ending)
A = list(reversed(A))
ending = max_slice = A[1]
max_slices_backwards = []
max_slices_backwards.append(max_slice)
for a in A[2:]:
ending = max(0, ending + a)
#max_slice = max(max_slice, max_ending)
max_slices_backwards.append(ending)
for i in range(1,len(A)-2):
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(max_slices_forward[i+1] + max_slices_backwards[i-1])
print(max_slices_forward)
print(max_slices_backwards)
print(A)
print(list(reversed(A)))
return max_slice
Code: 10:20:21 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = A[1]
max_slices_forward = []
max_slices_forward.append(max_slice)
for a in A[2:]:
ending = max(0, ending + a)
max_slices_forward.append(ending)
A = list(reversed(A))
ending = max_slice = A[1]
max_slices_backwards = []
max_slices_backwards.append(max_slice)
for a in A[2:]:
ending = max(0, ending + a)
#max_slice = max(max_slice, max_ending)
max_slices_backwards.append(ending)
for i in range(1,len(A)-2):
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(max_slices_forward[i+1] + max_slices_backwards[i-1])
print(max_slices_forward)
print(max_slices_backwards)
print(A)
print(list(reversed(A)))
return max_slice
Code: 10:20:31 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = A[1]
forward = []
forward.append(ending)
for a in A[2:]:
ending = max(0, ending + a)
forward.append(ending)
A = list(reversed(A))
ending = max_slice = A[1]
max_slices_backwards = []
max_slices_backwards.append(max_slice)
for a in A[2:]:
ending = max(0, ending + a)
#max_slice = max(max_slice, max_ending)
max_slices_backwards.append(ending)
for i in range(1,len(A)-2):
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(max_slices_forward[i+1] + max_slices_backwards[i-1])
print(max_slices_forward)
print(max_slices_backwards)
print(A)
print(list(reversed(A)))
return max_slice
Code: 10:21:54 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = A[1]
forward = []
forward.append(ending)
for a in A[2:]:
ending = max(0, ending + a)
forward.append(ending)
A = list(reversed(A))
ending = max_slice = A[1]
max_slibackwards = []
max_slices_backwards.append(max_slice)
for a in A[2:]:
ending = max(0, ending + a)
#max_slice = max(max_slice, max_ending)
max_slices_backwards.append(ending)
for i in range(1,len(A)-2):
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(max_slices_forward[i+1] + max_slices_backwards[i-1])
print(max_slices_forward)
print(max_slices_backwards)
print(A)
print(list(reversed(A)))
return max_slice
Code: 10:21:59 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = A[1]
forward = []
forward.append(ending)
for a in A[2:]:
ending = max(0, ending + a)
forward.append(ending)
A = list(reversed(A))
ending = max_slice = A[1]
backwards = []
backwards.append(max_slice)
for a in A[2:]:
ending = max(0, ending + a)
#max_slice = max(max_slice, max_ending)
backwards.append(ending)
for i in range(1,len(A)-2):
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(max_slices_forward[i+1] + max_slices_backwards[i-1])
print(max_slices_forward)
print(max_slices_backwards)
print(A)
print(list(reversed(A)))
return max_slice
Code: 10:22:01 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = A[1]
forward = []
forward.append(ending)
for a in A[2:]:
ending = max(0, ending + a)
forward.append(ending)
A = list(reversed(A))
ending = max_slice = A[1]
backwards = []
backwards.append(max_slice)
for a in A[2:]:
ending = max(0, ending + a)
#max_slice = max(max_slice, max_ending)
backwards.append(ending)
for i in range(1,len(A)-2):
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(max_slices_forward[i+1] + max_slices_backwards[i-1])
print(max_slices_forward)
print(max_slices_backwards)
print(A)
print(list(reversed(A)))
return max_slice
Analysis
expand all
Example tests
1.
0.040 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 129, in <module>
main()
File "exec.py", line 91, in main
result = solution( A )
File "/tmp/solution.py", line 25, in solution
print(max_slices_forward[i+1] + max_slices_backwards[i-1])
NameError: name 'max_slices_forward' is not defined
Code: 10:22:10 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = A[1]
forward = []
forward.append(ending)
for a in A[2:]:
ending = max(0, ending + a)
forward.append(ending)
A = list(reversed(A))
ending = max_slice = A[1]
backwards = []
backwards.append(max_slice)
for a in A[2:]:
ending = max(0, ending + a)
#max_slice = max(max_slice, max_ending)
backwards.append(ending)
for i in range(1,len(A)-2):
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(max_slices_forward[i+1] + backwards[i-1])
print(max_slices_forward)
print(max_slices_backwards)
print(A)
print(list(reversed(A)))
return max_slice
Code: 10:22:12 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = A[1]
forward = []
forward.append(ending)
for a in A[2:]:
ending = max(0, ending + a)
forward.append(ending)
A = list(reversed(A))
ending = max_slice = A[1]
backwards = []
backwards.append(max_slice)
for a in A[2:]:
ending = max(0, ending + a)
#max_slice = max(max_slice, max_ending)
backwards.append(ending)
for i in range(1,len(A)-2):
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i+1] + backwards[i-1])
print(max_slices_forward)
print(max_slices_backwards)
print(A)
print(list(reversed(A)))
return max_slice
Analysis
expand all
Example tests
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 129, in <module>
main()
File "exec.py", line 91, in main
result = solution( A )
File "/tmp/solution.py", line 27, in solution
print(max_slices_forward)
NameError: name 'max_slices_forward' is not defined
stdout:
6 15 24 22 30
Code: 10:22:21 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = A[1]
forward = []
forward.append(ending)
for a in A[2:]:
ending = max(0, ending + a)
forward.append(ending)
A = list(reversed(A))
ending = max_slice = A[1]
backwards = []
backwards.append(max_slice)
for a in A[2:]:
ending = max(0, ending + a)
#max_slice = max(max_slice, max_ending)
backwards.append(ending)
for i in range(1,len(A)-2):
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i-1] + backwards[i+1])
print(max_slices_forward)
print(max_slices_backwards)
print(A)
print(list(reversed(A)))
return max_slice
Analysis
expand all
Example tests
1.
0.040 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 129, in <module>
main()
File "exec.py", line 91, in main
result = solution( A )
File "/tmp/solution.py", line 27, in solution
print(max_slices_forward)
NameError: name 'max_slices_forward' is not defined
stdout:
10 15 20 26 34
Code: 10:22:46 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = A[1]
forward = []
forward.append(ending)
for a in A[2:]:
ending = max(0, ending + a)
forward.append(ending)
A = list(reversed(A))
ending = max_slice = A[1]
backwards = []
backwards.append(max_slice)
for a in A[2:]:
ending = max(0, ending + a)
#max_slice = max(max_slice, max_ending)
backwards.append(ending)
for i in range(1,len(A)-2):
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i-1] + backwards[i+1])
print(forward)
print(max_slices_backwards)
print(A)
print(list(reversed(A)))
return max_slice
Code: 10:22:59 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = A[1]
forward = []
forward.append(ending)
for a in A[2:]:
ending = max(0, ending + a)
forward.append(ending)
print(A)
A = list(reversed(A))
ending = max_slice = A[1]
backwards = []
backwards.append(max_slice)
for a in A[2:]:
ending = max(0, ending + a)
#max_slice = max(max_slice, max_ending)
backwards.append(ending)
for i in range(1,len(A)-2):
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i-1] + backwards[i+1])
print(forward)
print(backwards)
print(list(reversed(A)))
return max_slice
Code: 10:23:01 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = A[1]
forward = []
forward.append(ending)
for a in A[2:]:
ending = max(0, ending + a)
forward.append(ending)
print(A)
A = list(reversed(A))
print(A)
ending = max_slice = A[1]
backwards = []
backwards.append(max_slice)
for a in A[2:]:
ending = max(0, ending + a)
#max_slice = max(max_slice, max_ending)
backwards.append(ending)
for i in range(1,len(A)-2):
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i-1] + backwards[i+1])
print(forward)
print(backwards)
print(list(reversed(A)))
return max_slice
Code: 10:23:22 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = A[1]
forward = []
forward.append(ending)
for a in A[2:]:
ending = max(0, ending + a)
forward.append(ending)
print(A)
print(forward)
A = list(reversed(A))
ending = max_slice = A[1]
backwards = []
backwards.append(max_slice)
for a in A[2:]:
ending = max(0, ending + a)
#max_slice = max(max_slice, max_ending)
backwards.append(ending)
for i in range(1,len(A)-2):
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i-1] + backwards[i+1])
print(A)
print(backwards)
return max_slice
Analysis
expand all
Example tests
1.
0.036 s
WRONG ANSWER,
got -1 expected 17
stdout:
[3, 2, 6, -1, 4, 5, -1, 2] [2, 8, 7, 11, 16, 15, 17] 10 15 20 26 34 [2, -1, 5, 4, -1, 6, 2, 3] [-1, 4, 8, 7, 13, 15, 18]
Code: 10:23:35 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = A[1]
forward = []
forward.append(ending)
for a in A[2:]:
ending = max(0, ending + a)
forward.append(ending)
print(A)
print(forward)
A = list(reversed(A))
ending = max_slice = A[1]
backwards = []
backwards.append(max_slice)
for a in A[2:]:
ending = max(0, ending + a)
backwards.append(ending)
for i in range(1,len(A)-2):
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i-1] + backwards[i+1])
print(A)
print(backwards)
return max_slice
Code: 10:23:46 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = A[1]
forward = []
forward.append(ending)
for a in A[2:]:
ending = max(0, ending + a)
forward.append(ending)
print(A)
print(forward)
A = list(reversed(A))
ending = max_slice = A[1]
backwards = []
backwards.append(max_slice)
for a in A[2:]:
ending = max(0, ending + a)
backwards.append(ending)
for i in range(1,len(A)-2):
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i-1] + backwards[i+1])
print(A)
print(backwards)
return max_slice
Code: 10:24:30 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = A[1]
forward = []
forward.append(ending)
for a in A[2:]:
ending = max(0, ending + a)
forward.append(ending)
print(A)
print(forward)
A = list(reversed(A))
ending = max_slice = A[1]
backwards = []
backwards.append(ending)
for a in A[2:]:
ending = max(0, ending + a)
backwards.append(ending)
for i in range(1,len(A)-2):
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i-1] + backwards[i+1])
print(A)
print(backwards)
return max_slice
Code: 10:24:33 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = A[1]
forward = []
forward.append(ending)
for a in A[2:]:
ending = max(0, ending + a)
forward.append(ending)
print(A)
print(forward)
A = list(reversed(A))
ending = A[1]
backwards = []
backwards.append(ending)
for a in A[2:]:
ending = max(0, ending + a)
backwards.append(ending)
for i in range(1,len(A)-2):
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i-1] + backwards[i+1])
print(A)
print(backwards)
return max_slice
Analysis
expand all
Example tests
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 129, in <module>
main()
File "exec.py", line 91, in main
result = solution( A )
File "/tmp/solution.py", line 32, in solution
return max_slice
NameError: name 'max_slice' is not defined
stdout:
[3, 2, 6, -1, 4, 5, -1, 2] [2, 8, 7, 11, 16, 15, 17] 10 15 20 26 34 [2, -1, 5, 4, -1, 6, 2, 3] [-1, 4, 8, 7, 13, 15, 18]
Code: 10:28:14 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = A[1]
forward = []
forward.append(ending)
for a in A[2:]:
ending = max(0, ending + a)
forward.append(ending)
print(A)
print(forward)
A = list(reversed(A))
ending = A[1]
backwards = []
backwards.append(ending)
for a in A[2:]:
ending = max(0, ending + a)
backwards.append(ending)
for i in range(1,len(A)-2):
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i-1] + backwards[i+1])
print(A)
print(backwards)
return max_slice
Code: 10:28:27 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = A[1]
forward = []
forward.append(ending)
for a in A[2:]:
ending = max(0, ending + a)
forward.append(ending)
print(A)
print( A[2:])
print(forward)
A = list(reversed(A))
ending = A[1]
backwards = []
backwards.append(ending)
for a in A[2:]:
ending = max(0, ending + a)
backwards.append(ending)
for i in range(1,len(A)-2):
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i-1] + backwards[i+1])
print(A)
print(backwards)
return max_slice
Code: 10:28:30 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = A[1]
forward = []
forward.append(ending)
for a in A[2:]:
ending = max(0, ending + a)
forward.append(ending)
print(A)
print(A[2:])
print(forward)
A = list(reversed(A))
ending = A[1]
backwards = []
backwards.append(ending)
for a in A[2:]:
ending = max(0, ending + a)
backwards.append(ending)
for i in range(1,len(A)-2):
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i-1] + backwards[i+1])
print(A)
print(backwards)
return max_slice
Analysis
expand all
Example tests
1.
0.056 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 129, in <module>
main()
File "exec.py", line 91, in main
result = solution( A )
File "/tmp/solution.py", line 33, in solution
return max_slice
NameError: name 'max_slice' is not defined
stdout:
[3, 2, 6, -1, 4, 5, -1, 2] [6, -1, 4, 5, -1, 2] [2, 8, 7, 11, 16, 15, 17] 10 15 20 26 34 [2, -1, 5, 4, -1, 6, 2, 3] [-1, 4, 8, 7, 13, 15, 18]
Code: 10:28:45 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = A[1]
forward = []
forward.append(ending)
for a in A[2:]:
ending = max(0, ending + a)
forward.append(ending)
print(A)
print(A[2:-2])
print(forward)
A = list(reversed(A))
ending = A[1]
backwards = []
backwards.append(ending)
for a in A[2:]:
ending = max(0, ending + a)
backwards.append(ending)
for i in range(1,len(A)-2):
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i-1] + backwards[i+1])
print(A)
print(backwards)
return max_slice
Analysis
expand all
Example tests
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 129, in <module>
main()
File "exec.py", line 91, in main
result = solution( A )
File "/tmp/solution.py", line 33, in solution
return max_slice
NameError: name 'max_slice' is not defined
stdout:
[3, 2, 6, -1, 4, 5, -1, 2] [6, -1, 4, 5] [2, 8, 7, 11, 16, 15, 17] 10 15 20 26 34 [2, -1, 5, 4, -1, 6, 2, 3] [-1, 4, 8, 7, 13, 15, 18]
Code: 10:28:52 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = A[1]
forward = []
forward.append(ending)
for a in A[2:]:
ending = max(0, ending + a)
forward.append(ending)
print(A)
print(A[2:-1])
print(forward)
A = list(reversed(A))
ending = A[1]
backwards = []
backwards.append(ending)
for a in A[2:]:
ending = max(0, ending + a)
backwards.append(ending)
for i in range(1,len(A)-2):
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i-1] + backwards[i+1])
print(A)
print(backwards)
return max_slice
Analysis
expand all
Example tests
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 129, in <module>
main()
File "exec.py", line 91, in main
result = solution( A )
File "/tmp/solution.py", line 33, in solution
return max_slice
NameError: name 'max_slice' is not defined
stdout:
[3, 2, 6, -1, 4, 5, -1, 2] [6, -1, 4, 5, -1] [2, 8, 7, 11, 16, 15, 17] 10 15 20 26 34 [2, -1, 5, 4, -1, 6, 2, 3] [-1, 4, 8, 7, 13, 15, 18]
Code: 10:29:07 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = A[1]
forward = []
forward.append(ending)
for a in A[1:]:
ending = max(0, ending + a)
forward.append(ending)
print(A)
print(A[2:-1])
print(forward)
A = list(reversed(A))
ending = A[1]
backwards = []
backwards.append(ending)
for a in A[2:]:
ending = max(0, ending + a)
backwards.append(ending)
for i in range(1,len(A)-2):
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i-1] + backwards[i+1])
print(A)
print(backwards)
return max_slice
Code: 10:29:17 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = A[1]
forward = []
forward.append(ending)
for a in A[1:-1]:
ending = max(0, ending + a)
forward.append(ending)
print(A)
print(A[2:-1])
print(forward)
A = list(reversed(A))
ending = A[1]
backwards = []
backwards.append(ending)
for a in A[2:]:
ending = max(0, ending + a)
backwards.append(ending)
for i in range(1,len(A)-2):
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i-1] + backwards[i+1])
print(A)
print(backwards)
return max_slice
Code: 10:29:47 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = A[1]
forward = []
forward.append(ending)
for a in A[2:-1]:
ending = max(0, ending + a)
forward.append(ending)
print(A)
print(A[2:-1])
print(forward)
A = list(reversed(A))
ending = A[1]
backwards = []
backwards.append(ending)
for a in A[2:]:
ending = max(0, ending + a)
backwards.append(ending)
for i in range(1,len(A)-2):
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i-1] + backwards[i+1])
print(A)
print(backwards)
return max_slice
Code: 10:30:05 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = A[1]
forward = []
forward.append(ending)
for a in A[2:-1]:
ending = max(0, ending + a)
forward.append(ending)
print(A)
print(A[2:-1])
print(forward)
A = list(reversed(A))
ending = A[1]
backwards = []
backwards.append(ending)
for a in A[2:-1]:
ending = max(0, ending + a)
backwards.append(ending)
for i in range(1,len(A)-2):
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i-1] + backwards[i+1])
print(A)
print(backwards)
return max_slice
Analysis
expand all
Example tests
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 129, in <module>
main()
File "exec.py", line 91, in main
result = solution( A )
File "/tmp/solution.py", line 27, in solution
print(forward[i-1] + backwards[i+1])
IndexError: list index out of range
stdout:
[3, 2, 6, -1, 4, 5, -1, 2] [6, -1, 4, 5, -1] [2, 8, 7, 11, 16, 15] 10 15 20 26
Code: 10:30:40 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = A[1]
forward = []
forward.append(ending)
for a in A[2:-1]:
ending = max(0, ending + a)
forward.append(ending)
print(A)
print(A[2:-1])
print(forward)
A = list(reversed(A))
ending = A[1]
backwards = []
backwards.append(ending)
for a in A[2:-1]:
ending = max(0, ending + a)
backwards.append(ending)
for i in range(1,len(A)-2):
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i-1] + backwards[i+1])
print(A)
print(backwards)
return max_slice
Code: 10:30:44 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = A[1]
forward = []
forward.append(ending)
for a in A[2:-1]:
ending = max(0, ending + a)
forward.append(ending)
print(A)
print(A[2:-1])
print(forward)
A = list(reversed(A))
ending = A[1]
backwards = []
backwards.append(ending)
for a in A[2:-1]:
ending = max(0, ending + a)
backwards.append(ending)
for i in range(1,len(A)-2):
print(i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i-1] + backwards[i+1])
print(A)
print(backwards)
return max_slice
Analysis
expand all
Example tests
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 129, in <module>
main()
File "exec.py", line 91, in main
result = solution( A )
File "/tmp/solution.py", line 28, in solution
print(forward[i-1] + backwards[i+1])
IndexError: list index out of range
stdout:
[3, 2, 6, -1, 4, 5, -1, 2] [6, -1, 4, 5, -1] [2, 8, 7, 11, 16, 15] 1 10 2 15 3 20 4 26 5
Code: 10:30:56 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = A[1]
forward = []
forward.append(ending)
for a in A[2:-1]:
ending = max(0, ending + a)
forward.append(ending)
print(A)
print(A[2:-1])
print(forward)
A = list(reversed(A))
ending = A[1]
backwards = []
backwards.append(ending)
for a in A[2:-1]:
ending = max(0, ending + a)
backwards.append(ending)
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i-1] + backwards[i+1])
print(A)
print(backwards)
return max_slice
Analysis
expand all
Example tests
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 129, in <module>
main()
File "exec.py", line 91, in main
result = solution( A )
File "/tmp/solution.py", line 28, in solution
print(forward[i-1] + backwards[i+1])
IndexError: list index out of range
stdout:
[3, 2, 6, -1, 4, 5, -1, 2] [6, -1, 4, 5, -1] [2, 8, 7, 11, 16, 15] i: 1 10 i: 2 15 i: 3 20 i: 4 26 i: 5
Code: 10:31:23 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = A[1]
forward = []
forward.append(ending)
for a in A[2:-1]:
ending = max(0, ending + a)
forward.append(ending)
print(A)
print(A[2:-1])
print(forward)
A = list(reversed(A))
ending = A[1]
backwards = []
backwards.append(ending)
for a in A[2:-1]:
ending = max(0, ending + a)
backwards.append(ending)
for i in range(1,len(A)-3):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i-1] + backwards[i+1])
print(A)
print(backwards)
return max_slice
Code: 10:31:23 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = A[1]
forward = []
forward.append(ending)
for a in A[2:-1]:
ending = max(0, ending + a)
forward.append(ending)
print(A)
print(A[2:-1])
print(forward)
A = list(reversed(A))
ending = A[1]
backwards = []
backwards.append(ending)
for a in A[2:-1]:
ending = max(0, ending + a)
backwards.append(ending)
for i in range(1,len(A)-3):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i-1] + backwards[i+1])
print(A)
print(backwards)
return max_slice
Analysis
expand all
Example tests
1.
0.040 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 129, in <module>
main()
File "exec.py", line 91, in main
result = solution( A )
File "/tmp/solution.py", line 34, in solution
return max_slice
NameError: name 'max_slice' is not defined
stdout:
[3, 2, 6, -1, 4, 5, -1, 2] [6, -1, 4, 5, -1] [2, 8, 7, 11, 16, 15] i: 1 10 i: 2 15 i: 3 20 i: 4 26 [2, -1, 5, 4, -1, 6, 2, 3] [-1, 4, 8, 7, 13, 15]
Code: 10:31:43 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = A[1]
forward = []
forward.append(ending)
for a in A[2:-1]:
ending = max(0, ending + a)
forward.append(ending)
print(A)
print(A[2:-1])
print(forward)
A = list(reversed(A))
ending = A[1]
backwards = []
backwards.append(ending)
for a in A[2:-1]:
ending = max(0, ending + a)
backwards.append(ending)
for i in range(1,len(A)-3):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i-1] + backwards[i+1])
print(A)
print(backwards)
return 0
Analysis
expand all
Example tests
1.
0.052 s
WRONG ANSWER,
got 0 expected 17
stdout:
[3, 2, 6, -1, 4, 5, -1, 2] [6, -1, 4, 5, -1] [2, 8, 7, 11, 16, 15] i: 1 10 i: 2 15 i: 3 20 i: 4 26 [2, -1, 5, 4, -1, 6, 2, 3] [-1, 4, 8, 7, 13, 15]
Code: 10:32:00 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = A[1]
forward = []
forward.append(ending)
for a in A[2:-1]:
ending = max(0, ending + a)
forward.append(ending)
print(A)
print(A[2:-1])
print(forward)
A = list(reversed(A))
ending = A[1]
backwards = []
backwards.append(ending)
for a in A[2:-1]:
ending = max(0, ending + a)
backwards.append(ending)
for i in range(1,len(A)-1):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i-1] + backwards[i+1])
print(A)
print(backwards)
return 0
Code: 10:32:01 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = A[1]
forward = []
forward.append(ending)
for a in A[2:-1]:
ending = max(0, ending + a)
forward.append(ending)
print(A)
print(A[2:-1])
print(forward)
A = list(reversed(A))
ending = A[1]
backwards = []
backwards.append(ending)
for a in A[2:-1]:
ending = max(0, ending + a)
backwards.append(ending)
for i in range(1,len(A)-1):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i-1] + backwards[i+1])
print(A)
print(backwards)
return 0
Analysis
expand all
Example tests
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 129, in <module>
main()
File "exec.py", line 91, in main
result = solution( A )
File "/tmp/solution.py", line 28, in solution
print(forward[i-1] + backwards[i+1])
IndexError: list index out of range
stdout:
[3, 2, 6, -1, 4, 5, -1, 2] [6, -1, 4, 5, -1] [2, 8, 7, 11, 16, 15] i: 1 10 i: 2 15 i: 3 20 i: 4 26 i: 5
Code: 10:32:21 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = A[1]
forward = []
forward.append(ending)
for a in A[2:-1]:
ending = max(0, ending + a)
forward.append(ending)
print(A)
print(A[2:-1])
print(forward)
A = list(reversed(A))
ending = A[1]
backwards = []
backwards.append(ending)
for a in A[2:-1]:
ending = max(0, ending + a)
backwards.append(ending)
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i-1] + backwards[i+1])
print(A)
print(backwards)
return 0
Code: 10:32:21 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = A[1]
forward = []
forward.append(ending)
for a in A[2:-1]:
ending = max(0, ending + a)
forward.append(ending)
print(A)
print(A[2:-1])
print(forward)
A = list(reversed(A))
ending = A[1]
backwards = []
backwards.append(ending)
for a in A[2:-1]:
ending = max(0, ending + a)
backwards.append(ending)
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i-1] + backwards[i+1])
print(A)
print(backwards)
return 0
Analysis
expand all
Example tests
1.
0.056 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 129, in <module>
main()
File "exec.py", line 91, in main
result = solution( A )
File "/tmp/solution.py", line 28, in solution
print(forward[i-1] + backwards[i+1])
IndexError: list index out of range
stdout:
[3, 2, 6, -1, 4, 5, -1, 2] [6, -1, 4, 5, -1] [2, 8, 7, 11, 16, 15] i: 1 10 i: 2 15 i: 3 20 i: 4 26 i: 5
Code: 10:38:55 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = A[1]
forward = []
forward.append(ending)
for a in A[2:-1]:
ending = max(0, ending + a)
forward.append(ending)
print(A)
print(A[2:-1])
print(forward)
A = list(reversed(A))
ending = 0
backwards = []
backwards.append(ending)
for a in A[2:-1]:
ending = max(0, ending + a)
backwards.append(ending)
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i-1] + backwards[i+1])
print(A)
print(backwards)
return 0
Code: 10:39:06 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = A[1]
forward = []
forward.append(ending)
for a in A[2:-1]:
ending = max(0, ending + a)
forward.append(ending)
print(A)
print(A[2:-1])
print(forward)
A = list(reversed(A))
ending = 0
backwards = []
backwards.append(ending)
for a in A[1:-1]:
ending = max(0, ending + a)
backwards.append(ending)
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i-1] + backwards[i+1])
print(A)
print(backwards)
return 0
Code: 10:39:16 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = 0
forward = []
forward.append(ending)
for a in A[1:-1]:
ending = max(0, ending + a)
forward.append(ending)
print(A)
print(A[2:-1])
print(forward)
A = list(reversed(A))
ending = 0
backwards = []
backwards.append(ending)
for a in A[1:-1]:
ending = max(0, ending + a)
backwards.append(ending)
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i-1] + backwards[i+1])
print(A)
print(backwards)
return 0
Code: 10:39:30 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = 0
forward = []
forward.append(ending)
for a in A[1:-1]:
ending = max(0, ending + a)
forward.append(ending)
print(A)
print(A[2:-1])
print(forward)
A = list(reversed(A))
ending = 0
backwards = []
backwards.append(ending)
for a in A[1:-1]:
ending = max(0, ending + a)
backwards.append(ending)
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i-1] + backwards[i+1])
print(A)
print(backwards)
return 0
Analysis
expand all
Example tests
1.
0.036 s
WRONG ANSWER,
got 0 expected 17
stdout:
[3, 2, 6, -1, 4, 5, -1, 2] [6, -1, 4, 5, -1] [0, 2, 8, 7, 11, 16, 15] i: 1 5 i: 2 11 i: 3 16 i: 4 21 i: 5 27 [2, -1, 5, 4, -1, 6, 2, 3] [0, 0, 5, 9, 8, 14, 16]
Code: 10:40:48 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = 0
forward = []
forward.append(ending)
for a in A[1:-1]:
ending = max(0, ending + a)
forward.append(ending)
print(A)
print(A[:-1])
print(forward)
A = list(reversed(A))
ending = 0
backwards = []
backwards.append(ending)
for a in A[1:-1]:
ending = max(0, ending + a)
backwards.append(ending)
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i-1] + backwards[i+1])
print(A)
print(backwards)
return 0
Code: 10:41:06 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = 0
forward = []
forward.append(ending)
for a in A[1:-1]:
ending = max(0, ending + a)
forward.append(ending)
print(A)
print(A[1:-1])
print(forward)
A = list(reversed(A))
ending = 0
backwards = []
backwards.append(ending)
for a in A[1:-1]:
ending = max(0, ending + a)
backwards.append(ending)
print(A)
print(A[1:-1])
print(forward)
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i-1] + backwards[i+1])
print(A)
print(backwards)
return 0
Code: 10:41:12 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = 0
forward = []
forward.append(ending)
for a in A[1:-1]:
ending = max(0, ending + a)
forward.append(ending)
print(A)
print(A[1:-1])
print(forward)
A = list(reversed(A))
ending = 0
backwards = []
backwards.append(ending)
for a in A[1:-1]:
ending = max(0, ending + a)
backwards.append(ending)
print(A)
print(A[1:-1])
print(backwards)
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i-1] + backwards[i+1])
print(A)
print(backwards)
return 0
Analysis
expand all
Example tests
1.
0.036 s
WRONG ANSWER,
got 0 expected 17
stdout:
[3, 2, 6, -1, 4, 5, -1, 2] [2, 6, -1, 4, 5, -1] [0, 2, 8, 7, 11, 16, 15] [2, -1, 5, 4, -1, 6, 2, 3] [-1, 5, 4, -1, 6, 2] [0, 0, 5, 9, 8, 14, 16] i: 1 5 i: 2 11 i: 3 16 i: 4 21 i: 5 27 [2, -1, 5, 4, -1, 6, 2, 3] [0, 0, 5, 9, 8, 14, 16]
Code: 10:41:41 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = 0
forward = []
forward.append(ending)
for a in A[1:-1]:
ending = max(0, ending + a)
forward.append(ending)
print(A)
print(A[1:-1])
print(forward)
A = list(reversed(A))
ending = 0
backwards = []
backwards.append(ending)
for a in A[1:-1]:
ending = max(0, ending + a)
backwards.append(ending)
print(A)
print(A[1:-1])
print(backwards)
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i-1] + backwards[i+1])
print(A)
print(backwards)
return 0
Code: 10:41:51 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = 0
forward = []
forward.append(ending)
for a in A[1:-1]:
ending = max(0, ending + a)
forward.append(ending)
print(A)
print(A[1:-1])
print(forward)
A = list(reversed(A))
ending = 0
backwards = []
backwards.append(ending)
for a in A[1:-1]:
ending = max(0, ending + a)
backwards.append(ending)
print(A)
print(A[1:-1])
print(backwards)
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i-1] + backwards[i+1])
print(A)
print(backwards)
return 0
Analysis
expand all
Example tests
1.
0.036 s
WRONG ANSWER,
got 0 expected 17
stdout:
[3, 2, 6, -1, 4, 5, -1, 2] [2, 6, -1, 4, 5, -1] [0, 2, 8, 7, 11, 16, 15] [2, -1, 5, 4, -1, 6, 2, 3] [-1, 5, 4, -1, 6, 2] [0, 0, 5, 9, 8, 14, 16] i: 1 5 i: 2 11 i: 3 16 i: 4 21 i: 5 27 [2, -1, 5, 4, -1, 6, 2, 3] [0, 0, 5, 9, 8, 14, 16]
Code: 10:42:24 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = 0
forward = []
forward.append(ending)
for a in A[1:-1]:
ending = max(0, ending + a)
forward.append(ending)
print(A)
print(A[1:-1])
print(forward)
A = list(reversed(A))
ending = 0
backwards = []
backwards.append(ending)
for a in A[1:-1]:
ending = max(a, ending + a)
backwards.append(ending)
print(A)
print(A[1:-1])
print(backwards)
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i-1] + backwards[i+1])
print(A)
print(backwards)
return 0
Code: 10:42:25 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = 0
forward = []
forward.append(ending)
for a in A[1:-1]:
ending = max(0, ending + a)
forward.append(ending)
print(A)
print(A[1:-1])
print(forward)
A = list(reversed(A))
ending = 0
backwards = []
backwards.append(ending)
for a in A[1:-1]:
ending = max(a, ending + a)
backwards.append(ending)
print(A)
print(A[1:-1])
print(backwards)
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i-1] + backwards[i+1])
print(A)
print(backwards)
return 0
Analysis
expand all
Example tests
1.
0.040 s
WRONG ANSWER,
got 0 expected 17
stdout:
[3, 2, 6, -1, 4, 5, -1, 2] [2, 6, -1, 4, 5, -1] [0, 2, 8, 7, 11, 16, 15] [2, -1, 5, 4, -1, 6, 2, 3] [-1, 5, 4, -1, 6, 2] [0, -1, 5, 9, 8, 14, 16] i: 1 5 i: 2 11 i: 3 16 i: 4 21 i: 5 27 [2, -1, 5, 4, -1, 6, 2, 3] [0, -1, 5, 9, 8, 14, 16]
Code: 10:45:00 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = 0
forward = []
forward.append(ending)
for a in A[1:-1]:
ending = max(0, ending + a)
forward.append(ending)
print(A)
print(A[1:-1])
print(forward)
A = list(reversed(A))
ending = 0
backwards = []
backwards.append(ending)
for a in A[1:-1]:
ending = max(a, ending + a)
backwards.append(ending)
print(A)
print(A[1:-1])
print(backwards)
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i1] + backwards[i+1])
print(A)
print(backwards)
return 0
Code: 10:45:10 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = 0
forward = []
forward.append(ending)
for a in A[1:-1]:
ending = max(0, ending + a)
forward.append(ending)
print(A)
print(A[1:-1])
print(forward)
A = list(reversed(A))
ending = 0
backwards = []
backwards.append(ending)
for a in A[1:-1]:
ending = max(a, ending + a)
backwards.append(ending)
print(A)
print(A[1:-1])
print(backwards)
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i+1] + backwards[i-1])
print(A)
print(backwards)
return 0
Code: 10:45:10 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = 0
forward = []
forward.append(ending)
for a in A[1:-1]:
ending = max(0, ending + a)
forward.append(ending)
print(A)
print(A[1:-1])
print(forward)
A = list(reversed(A))
ending = 0
backwards = []
backwards.append(ending)
for a in A[1:-1]:
ending = max(a, ending + a)
backwards.append(ending)
print(A)
print(A[1:-1])
print(backwards)
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i+1] + backwards[i-1])
print(A)
print(backwards)
return 0
Analysis
expand all
Example tests
1.
0.036 s
WRONG ANSWER,
got 0 expected 17
stdout:
[3, 2, 6, -1, 4, 5, -1, 2] [2, 6, -1, 4, 5, -1] [0, 2, 8, 7, 11, 16, 15] [2, -1, 5, 4, -1, 6, 2, 3] [-1, 5, 4, -1, 6, 2] [0, -1, 5, 9, 8, 14, 16] i: 1 8 i: 2 6 i: 3 16 i: 4 25 i: 5 23 [2, -1, 5, 4, -1, 6, 2, 3] [0, -1, 5, 9, 8, 14, 16]
Code: 10:46:32 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
def solution(A):
A_len = len(A) # The length of array A
# Get the sum of maximum subarray, which ends this position
# Method: http://en.wikipedia.org/wiki/Maximum_subarray_problem
max_ending_here = [0] * A_len
max_ending_here_temp = 0
for index in xrange(1, A_len-2):
max_ending_here_temp = max(0, A[index]+max_ending_here_temp)
max_ending_here[index] = max_ending_here_temp
# Get the sum of maximum subarray, which begins this position
# The same method. But we travel from the tail to the head
max_beginning_here = [0] * A_len
max_beginning_here_temp = 0
for index in xrange(A_len-2, 1, -1):
max_beginning_here_temp = max(0, A[index]+max_beginning_here_temp)
max_beginning_here[index] = max_beginning_here_temp
# Connect two subarray for a double_slice. If the first subarray
# ends at position i, the second subarray starts at position i+2.
# Then we compare each double slice to get the one with the
# greatest sum.
max_double_slice = 0
for index in xrange(0, A_len-2):
max_double_slice = max(max_double_slice,
max_ending_here[index] + max_beginning_here[index+2] )
return max_double_slice
Code: 10:46:34 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
def solution(A):
A_len = len(A) # The length of array A
# Get the sum of maximum subarray, which ends this position
# Method: http://en.wikipedia.org/wiki/Maximum_subarray_problem
max_ending_here = [0] * A_len
max_ending_here_temp = 0
for index in xrange(1, A_len-2):
max_ending_here_temp = max(0, A[index]+max_ending_here_temp)
max_ending_here[index] = max_ending_here_temp
# Get the sum of maximum subarray, which begins this position
# The same method. But we travel from the tail to the head
max_beginning_here = [0] * A_len
max_beginning_here_temp = 0
for index in xrange(A_len-2, 1, -1):
max_beginning_here_temp = max(0, A[index]+max_beginning_here_temp)
max_beginning_here[index] = max_beginning_here_temp
# Connect two subarray for a double_slice. If the first subarray
# ends at position i, the second subarray starts at position i+2.
# Then we compare each double slice to get the one with the
# greatest sum.
max_double_slice = 0
for index in xrange(0, A_len-2):
max_double_slice = max(max_double_slice,
max_ending_here[index] + max_beginning_here[index+2] )
return max_double_slice
Analysis
expand all
Example tests
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 129, in <module>
main()
File "exec.py", line 91, in main
result = solution( A )
File "/tmp/solution.py", line 35, in solution
for index in xrange(1, A_len-2):
NameError: name 'xrange' is not defined
Code: 10:46:46 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
A_len = len(A) # The length of array A
# Get the sum of maximum subarray, which ends this position
# Method: http://en.wikipedia.org/wiki/Maximum_subarray_problem
max_ending_here = [0] * A_len
max_ending_here_temp = 0
for index in xrange(1, A_len-2):
max_ending_here_temp = max(0, A[index]+max_ending_here_temp)
max_ending_here[index] = max_ending_here_temp
# Get the sum of maximum subarray, which begins this position
# The same method. But we travel from the tail to the head
max_beginning_here = [0] * A_len
max_beginning_here_temp = 0
for index in xrange(A_len-2, 1, -1):
max_beginning_here_temp = max(0, A[index]+max_beginning_here_temp)
max_beginning_here[index] = max_beginning_here_temp
# Connect two subarray for a double_slice. If the first subarray
# ends at position i, the second subarray starts at position i+2.
# Then we compare each double slice to get the one with the
# greatest sum.
max_double_slice = 0
for index in xrange(0, A_len-2):
max_double_slice = max(max_double_slice,
max_ending_here[index] + max_beginning_here[index+2] )
return max_double_slice
Analysis
expand all
Example tests
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 129, in <module>
main()
File "exec.py", line 91, in main
result = solution( A )
File "/tmp/solution.py", line 11, in solution
for index in xrange(1, A_len-2):
NameError: name 'xrange' is not defined
Code: 10:46:55 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
A_len = len(A) # The length of array A
# Get the sum of maximum subarray, which ends this position
# Method: http://en.wikipedia.org/wiki/Maximum_subarray_problem
max_ending_here = [0] * A_len
max_ending_here_temp = 0
for index in range(1, A_len-2):
max_ending_here_temp = max(0, A[index]+max_ending_here_temp)
max_ending_here[index] = max_ending_here_temp
# Get the sum of maximum subarray, which begins this position
# The same method. But we travel from the tail to the head
max_beginning_here = [0] * A_len
max_beginning_here_temp = 0
for index in xrange(A_len-2, 1, -1):
max_beginning_here_temp = max(0, A[index]+max_beginning_here_temp)
max_beginning_here[index] = max_beginning_here_temp
# Connect two subarray for a double_slice. If the first subarray
# ends at position i, the second subarray starts at position i+2.
# Then we compare each double slice to get the one with the
# greatest sum.
max_double_slice = 0
for index in range(0, A_len-2):
max_double_slice = max(max_double_slice,
max_ending_here[index] + max_beginning_here[index+2] )
return max_double_slice
Analysis
expand all
Example tests
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 129, in <module>
main()
File "exec.py", line 91, in main
result = solution( A )
File "/tmp/solution.py", line 18, in solution
for index in xrange(A_len-2, 1, -1):
NameError: name 'xrange' is not defined
Code: 10:47:02 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
A_len = len(A) # The length of array A
# Get the sum of maximum subarray, which ends this position
# Method: http://en.wikipedia.org/wiki/Maximum_subarray_problem
max_ending_here = [0] * A_len
max_ending_here_temp = 0
for index in range(1, A_len-2):
max_ending_here_temp = max(0, A[index]+max_ending_here_temp)
max_ending_here[index] = max_ending_here_temp
# Get the sum of maximum subarray, which begins this position
# The same method. But we travel from the tail to the head
max_beginning_here = [0] * A_len
max_beginning_here_temp = 0
for index in range(A_len-2, 1, -1):
max_beginning_here_temp = max(0, A[index]+max_beginning_here_temp)
max_beginning_here[index] = max_beginning_here_temp
# Connect two subarray for a double_slice. If the first subarray
# ends at position i, the second subarray starts at position i+2.
# Then we compare each double slice to get the one with the
# greatest sum.
max_double_slice = 0
for index in range(0, A_len-2):
max_double_slice = max(max_double_slice,
max_ending_here[index] + max_beginning_here[index+2] )
return max_double_slice
Code: 10:47:02 UTC,
py,
verify,
result: Passed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
A_len = len(A) # The length of array A
# Get the sum of maximum subarray, which ends this position
# Method: http://en.wikipedia.org/wiki/Maximum_subarray_problem
max_ending_here = [0] * A_len
max_ending_here_temp = 0
for index in range(1, A_len-2):
max_ending_here_temp = max(0, A[index]+max_ending_here_temp)
max_ending_here[index] = max_ending_here_temp
# Get the sum of maximum subarray, which begins this position
# The same method. But we travel from the tail to the head
max_beginning_here = [0] * A_len
max_beginning_here_temp = 0
for index in range(A_len-2, 1, -1):
max_beginning_here_temp = max(0, A[index]+max_beginning_here_temp)
max_beginning_here[index] = max_beginning_here_temp
# Connect two subarray for a double_slice. If the first subarray
# ends at position i, the second subarray starts at position i+2.
# Then we compare each double slice to get the one with the
# greatest sum.
max_double_slice = 0
for index in range(0, A_len-2):
max_double_slice = max(max_double_slice,
max_ending_here[index] + max_beginning_here[index+2] )
return max_double_slice
Analysis
Code: 10:47:14 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = 0
forward = []
forward.append(ending)
for a in A[1:-1]:
ending = max(0, ending + a)
forward.append(ending)
print(A)
print(A[1:-1])
print(forward)
A = list(reversed(A))
ending = 0
backwards = []
backwards.append(ending)
for a in A[1:-1]:
ending = max(a, ending + a)
backwards.append(ending)
print(A)
print(A[1:-1])
print(backwards)
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i+1] + backwards[i-1])
print(A)
print(backwards)
return 0
Code: 10:49:27 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = 0
forward = []
forward.append(ending)
for a in A[1:-1]:
ending = max(0, ending + a)
forward.append(ending)
print(A)
print(A[1:-1])
print(forward)
A = list(reversed(A))
ending = 0
backwards = []
backwards.append(ending)
for a in A[1:-1]:
ending = max(a, ending + a)
backwards.append(ending)
print(A)
print(A[1:-1])
print(backwards)
backwards =
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i+1] + backwards[i-1])
print(A)
print(backwards)
return 0
Code: 10:49:40 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = 0
forward = []
forward.append(ending)
for a in A[1:-1]:
ending = max(0, ending + a)
forward.append(ending)
print(A)
print(A[1:-1])
print(forward)
A = list(reversed(A))
ending = 0
backwards = []
backwards.append(ending)
for a in A[1:-1]:
ending = max(a, ending + a)
backwards.append(ending)
print(A)
print(A[1:-1])
print(backwards)
backwards = list(reversed(backwards))
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i+1] + backwards[i-1])
print(A)
print(backwards)
return 0
Analysis
expand all
Example tests
1.
0.056 s
WRONG ANSWER,
got 0 expected 17
stdout:
[3, 2, 6, -1, 4, 5, -1, 2] [2, 6, -1, 4, 5, -1] [0, 2, 8, 7, 11, 16, 15] [2, -1, 5, 4, -1, 6, 2, 3] [-1, 5, 4, -1, 6, 2] [0, -1, 5, 9, 8, 14, 16] i: 1 24 i: 2 21 i: 3 19 i: 4 25 i: 5 20 [2, -1, 5, 4, -1, 6, 2, 3] [16, 14, 8, 9, 5, -1, 0]
Code: 10:49:58 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
ending = 0
forward = [0]
forward.append(ending)
for a in A[1:-1]:
ending = max(0, ending + a)
forward.append(ending)
print(A)
print(A[1:-1])
print(forward)
A = list(reversed(A))
ending = 0
backwards = []
backwards.append(ending)
for a in A[1:-1]:
ending = max(a, ending + a)
backwards.append(ending)
print(A)
print(A[1:-1])
print(backwards)
backwards = list(reversed(backwards))
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i+1] + backwards[i-1])
print(A)
print(backwards)
return 0
Code: 10:50:12 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
forward.append(ending)
for a in A[1:-1]:
ending = max(0, ending + a)
forward.append(ending)
print(A)
print(A[1:-1])
print(forward)
A = list(reversed(A))
ending = 0
backwards = []
backwards.append(ending)
for a in A[1:-1]:
ending = max(a, ending + a)
backwards.append(ending)
print(A)
print(A[1:-1])
print(backwards)
backwards = list(reversed(backwards))
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i+1] + backwards[i-1])
print(A)
print(backwards)
return 0
Code: 10:50:36 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
for i in range(1,len(A):
ending = max(0, ending + a)
forward.append(ending)
print(A)
print(A[1:-1])
print(forward)
A = list(reversed(A))
ending = 0
backwards = []
backwards.append(ending)
for a in A[1:-1]:
ending = max(a, ending + a)
backwards.append(ending)
print(A)
print(A[1:-1])
print(backwards)
backwards = list(reversed(backwards))
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i+1] + backwards[i-1])
print(A)
print(backwards)
return 0
Code: 10:50:46 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A):
ending = max(0, ending + a)
forward.append(ending)
print(A)
print(A[1:-1])
print(forward)
A = list(reversed(A))
ending = 0
backwards = []
backwards.append(ending)
for a in A[1:-1]:
ending = max(a, ending + a)
backwards.append(ending)
print(A)
print(A[1:-1])
print(backwards)
backwards = list(reversed(backwards))
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i+1] + backwards[i-1])
print(A)
print(backwards)
return 0
Code: 10:51:10 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)):
ending = max(0, ending + a)
forward.append(ending)
print(A)
print(A[1:-1])
print(forward)
A = list(reversed(A))
ending = 0
backwards = []
backwards.append(ending)
for a in A[1:-1]:
ending = max(a, ending + a)
backwards.append(ending)
print(A)
print(A[1:-1])
print(backwards)
backwards = list(reversed(backwards))
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i+1] + backwards[i-1])
print(A)
print(backwards)
return 0
Code: 10:51:25 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, ending + A[i])
forward.append(ending)
print(A)
print(A[1:-1])
print(forward)
A = list(reversed(A))
ending = 0
backwards = []
backwards.append(ending)
for a in A[1:-1]:
ending = max(a, ending + a)
backwards.append(ending)
print(A)
print(A[1:-1])
print(backwards)
backwards = list(reversed(backwards))
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i+1] + backwards[i-1])
print(A)
print(backwards)
return 0
Code: 10:51:48 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, ending + A[i])
forward[i] = ending
print(A)
print(A[1:-1])
print(forward)
A = list(reversed(A))
ending = 0
backwards = []
backwards.append(ending)
for a in A[1:-1]:
ending = max(a, ending + a)
backwards.append(ending)
print(A)
print(A[1:-1])
print(backwards)
backwards = list(reversed(backwards))
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i+1] + backwards[i-1])
print(A)
print(backwards)
return 0
Code: 10:52:03 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, forward[i-1] + A[i])
forward[i] = ending
print(A)
print(A[1:-1])
print(forward)
A = list(reversed(A))
ending = 0
backwards = []
backwards.append(ending)
for a in A[1:-1]:
ending = max(a, ending + a)
backwards.append(ending)
print(A)
print(A[1:-1])
print(backwards)
backwards = list(reversed(backwards))
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i+1] + backwards[i-1])
print(A)
print(backwards)
return 0
Analysis
expand all
Example tests
1.
0.036 s
WRONG ANSWER,
got 0 expected 17
stdout:
[3, 2, 6, -1, 4, 5, -1, 2] [2, 6, -1, 4, 5, -1] [0, 2, 8, 7, 11, 16, 0, 0] [2, -1, 5, 4, -1, 6, 2, 3] [-1, 5, 4, -1, 6, 2] [0, -1, 5, 9, 8, 14, 16] i: 1 24 i: 2 21 i: 3 19 i: 4 25 i: 5 5 [2, -1, 5, 4, -1, 6, 2, 3] [16, 14, 8, 9, 5, -1, 0]
Code: 10:52:19 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, forward[i-1] + A[i])
forward[i] = ending
print(A)
print(A[1:-1])
print(forward)
for i in range(1,len(A)-2):
ending = max(0, forward[i-1] + A[i])
forward[i] = ending
A = list(reversed(A))
ending = 0
backwards = []
backwards.append(ending)
for a in A[1:-1]:
ending = max(a, ending + a)
backwards.append(ending)
print(A)
print(A[1:-1])
print(backwards)
backwards = list(reversed(backwards))
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i+1] + backwards[i-1])
print(A)
print(backwards)
return 0
Code: 10:52:32 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, forward[i-1] + A[i])
forward[i] = ending
print(A)
print(A[1:-1])
print(forward)
for a in A[1:-1]:
ending = max(0, forward[i-1] + A[i])
forward[i] = ending
A = list(reversed(A))
ending = 0
backwards = []
backwards.append(ending)
for a in A[1:-1]:
ending = max(a, ending + a)
backwards.append(ending)
print(A)
print(A[1:-1])
print(backwards)
backwards = list(reversed(backwards))
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i+1] + backwards[i-1])
print(A)
print(backwards)
return 0
Code: 10:52:45 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, forward[i-1] + A[i])
forward[i] = ending
print(A)
print(A[1:-1])
print(forward)
for a in A[1:-1]:
ending = max(0, ending + a)
forward.append(ending)
A = list(reversed(A))
ending = 0
backwards = []
backwards.append(ending)
for a in A[1:-1]:
ending = max(a, ending + a)
backwards.append(ending)
print(A)
print(A[1:-1])
print(backwards)
backwards = list(reversed(backwards))
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i+1] + backwards[i-1])
print(A)
print(backwards)
return 0
Code: 10:52:53 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, forward[i-1] + A[i])
forward[i] = ending
print(A)
print(A[1:-1])
print(forward)
forward = [0] * len(A)
ending = 0
for a in A[1:-1]:
ending = max(0, ending + a)
forward.append(ending)
A = list(reversed(A))
ending = 0
backwards = []
backwards.append(ending)
for a in A[1:-1]:
ending = max(a, ending + a)
backwards.append(ending)
print(A)
print(A[1:-1])
print(backwards)
backwards = list(reversed(backwards))
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i+1] + backwards[i-1])
print(A)
print(backwards)
return 0
Code: 10:53:02 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, forward[i-1] + A[i])
forward[i] = ending
print(A)
print(A[1:-1])
print(forward)
forward = [0] * len(A)
ending = A
for a in A[1:-1]:
ending = max(0, ending + a)
forward.append(ending)
A = list(reversed(A))
ending = 0
backwards = []
backwards.append(ending)
for a in A[1:-1]:
ending = max(a, ending + a)
backwards.append(ending)
print(A)
print(A[1:-1])
print(backwards)
backwards = list(reversed(backwards))
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i+1] + backwards[i-1])
print(A)
print(backwards)
return 0
Code: 10:53:12 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, forward[i-1] + A[i])
forward[i] = ending
print(A)
print(A[1:-1])
print(forward)
forward = [0] * len(A)
ending = A[1]
for a in A[2:-1]:
ending = max(0, ending + a)
forward.append(ending)
A = list(reversed(A))
ending = 0
backwards = []
backwards.append(ending)
for a in A[1:-1]:
ending = max(a, ending + a)
backwards.append(ending)
print(A)
print(A[1:-1])
print(backwards)
backwards = list(reversed(backwards))
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i+1] + backwards[i-1])
print(A)
print(backwards)
return 0
Code: 10:53:33 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, forward[i-1] + A[i])
forward[i] = ending
print(A)
print("forward1: ", forward)
forward = [0] * len(A)
ending = A[1]
for a in A[2:-1]:
ending = max(0, ending + a)
forward.append(ending)
print("forward2: ", forward)
A = list(reversed(A))
ending = 0
backwards = []
backwards.append(ending)
for a in A[1:-1]:
ending = max(a, ending + a)
backwards.append(ending)
print(A)
print(A[1:-1])
print(backwards)
backwards = list(reversed(backwards))
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i+1] + backwards[i-1])
print(A)
print(backwards)
return 0
Code: 10:53:33 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, forward[i-1] + A[i])
forward[i] = ending
print(A)
print("forward1: ", forward)
forward = [0] * len(A)
ending = A[1]
for a in A[2:-1]:
ending = max(0, ending + a)
forward.append(ending)
print("forward2: ", forward)
A = list(reversed(A))
ending = 0
backwards = []
backwards.append(ending)
for a in A[1:-1]:
ending = max(a, ending + a)
backwards.append(ending)
print(A)
print(A[1:-1])
print(backwards)
backwards = list(reversed(backwards))
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i+1] + backwards[i-1])
print(A)
print(backwards)
return 0
Analysis
expand all
Example tests
1.
0.036 s
WRONG ANSWER,
got 0 expected 17
stdout:
[3, 2, 6, -1, 4, 5, -1, 2] forward1: [0, 2, 8, 7, 11, 16, 0, 0] forward2: [0, 0, 0, 0, 0, 0, 0, 0, 8, 7, 11, 16, 15] [2, -1, 5, 4, -1, 6, 2, 3] [-1, 5, 4, -1, 6, 2] [0, -1, 5, 9, 8, 14, 16] i: 1 16 i: 2 14 i: 3 8 i: 4 9 i: 5 5 [2, -1, 5, 4, -1, 6, 2, 3] [16, 14, 8, 9, 5, -1, 0]
Code: 10:54:00 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, forward[i-1] + A[i])
forward[i] = ending
print(A)
print("forward1: ", forward)
forward = []
ending = A[1]
for a in A[2:-1]:
ending = max(0, ending + a)
forward.append(ending)
print("forward2: ", forward)
A = list(reversed(A))
ending = 0
backwards = []
backwards.append(ending)
for a in A[1:-1]:
ending = max(a, ending + a)
backwards.append(ending)
print(A)
print(A[1:-1])
print(backwards)
backwards = list(reversed(backwards))
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i+1] + backwards[i-1])
print(A)
print(backwards)
return 0
Code: 10:54:00 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, forward[i-1] + A[i])
forward[i] = ending
print(A)
print("forward1: ", forward)
forward = []
ending = A[1]
for a in A[2:-1]:
ending = max(0, ending + a)
forward.append(ending)
print("forward2: ", forward)
A = list(reversed(A))
ending = 0
backwards = []
backwards.append(ending)
for a in A[1:-1]:
ending = max(a, ending + a)
backwards.append(ending)
print(A)
print(A[1:-1])
print(backwards)
backwards = list(reversed(backwards))
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i+1] + backwards[i-1])
print(A)
print(backwards)
return 0
Analysis
expand all
Example tests
1.
0.040 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 129, in <module>
main()
File "exec.py", line 91, in main
result = solution( A )
File "/tmp/solution.py", line 38, in solution
print(forward[i+1] + backwards[i-1])
IndexError: list index out of range
stdout:
[3, 2, 6, -1, 4, 5, -1, 2] forward1: [0, 2, 8, 7, 11, 16, 0, 0] forward2: [8, 7, 11, 16, 15] [2, -1, 5, 4, -1, 6, 2, 3] [-1, 5, 4, -1, 6, 2] [0, -1, 5, 9, 8, 14, 16] i: 1 27 i: 2 30 i: 3 23 i: 4
Code: 10:54:20 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, forward[i-1] + A[i])
forward[i] = ending
print(A)
print("forward1: ", forward)
forward = []
ending = A[1]
forward.append(ending)
for a in A[2:-1]:
ending = max(0, ending + a)
forward.append(ending)
print("forward2: ", forward)
A = list(reversed(A))
ending = 0
backwards = []
backwards.append(ending)
for a in A[1:-1]:
ending = max(a, ending + a)
backwards.append(ending)
print(A)
print(A[1:-1])
print(backwards)
backwards = list(reversed(backwards))
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i+1] + backwards[i-1])
print(A)
print(backwards)
return 0
Analysis
expand all
Example tests
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last):
File "exec.py", line 129, in <module>
main()
File "exec.py", line 91, in main
result = solution( A )
File "/tmp/solution.py", line 39, in solution
print(forward[i+1] + backwards[i-1])
IndexError: list index out of range
stdout:
[3, 2, 6, -1, 4, 5, -1, 2] forward1: [0, 2, 8, 7, 11, 16, 0, 0] forward2: [2, 8, 7, 11, 16, 15] [2, -1, 5, 4, -1, 6, 2, 3] [-1, 5, 4, -1, 6, 2] [0, -1, 5, 9, 8, 14, 16] i: 1 23 i: 2 25 i: 3 24 i: 4 24 i: 5
Code: 10:54:40 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, forward[i-1] + A[i])
forward[i] = ending
print(A)
print("forward1: ", forward)
forward2 = []
ending = A[1]
forward.append(ending)
for a in A[2:-1]:
ending = max(0, ending + a)
forward.append(ending)
print("forward2: ", forward)
A = list(reversed(A))
ending = 0
backwards = []
backwards.append(ending)
for a in A[1:-1]:
ending = max(a, ending + a)
backwards.append(ending)
print(A)
print(A[1:-1])
print(backwards)
backwards = list(reversed(backwards))
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i+1] + backwards[i-1])
print(A)
print(backwards)
return 0
Code: 10:54:44 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, forward[i-1] + A[i])
forward[i] = ending
print(A)
print("forward1: ", forward)
forward2 = []
ending = A[1]
forward2.append(ending)
for a in A[2:-1]:
ending = max(0, ending + a)
forward2.append(ending)
print("forward2: ", forward2)
A = list(reversed(A))
ending = 0
backwards = []
backwards.append(ending)
for a in A[1:-1]:
ending = max(a, ending + a)
backwards.append(ending)
print(A)
print(A[1:-1])
print(backwards)
backwards = list(reversed(backwards))
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i+1] + backwards[i-1])
print(A)
print(backwards)
return 0
Analysis
expand all
Example tests
1.
0.036 s
WRONG ANSWER,
got 0 expected 17
stdout:
[3, 2, 6, -1, 4, 5, -1, 2] forward1: [0, 2, 8, 7, 11, 16, 0, 0] forward2: [2, 8, 7, 11, 16, 15] [2, -1, 5, 4, -1, 6, 2, 3] [-1, 5, 4, -1, 6, 2] [0, -1, 5, 9, 8, 14, 16] i: 1 24 i: 2 21 i: 3 19 i: 4 25 i: 5 5 [2, -1, 5, 4, -1, 6, 2, 3] [16, 14, 8, 9, 5, -1, 0]
Code: 10:55:00 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, forward[i-1] + A[i])
forward[i] = ending
print(A)
print("forward1: ", forward)
forward2 = []
ending = A[1]
forward2.append(ending)
for a in A[2:-2]:
ending = max(0, ending + a)
forward2.append(ending)
print("forward2: ", forward2)
A = list(reversed(A))
ending = 0
backwards = []
backwards.append(ending)
for a in A[1:-1]:
ending = max(a, ending + a)
backwards.append(ending)
print(A)
print(A[1:-1])
print(backwards)
backwards = list(reversed(backwards))
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i+1] + backwards[i-1])
print(A)
print(backwards)
return 0
Analysis
expand all
Example tests
1.
0.036 s
WRONG ANSWER,
got 0 expected 17
stdout:
[3, 2, 6, -1, 4, 5, -1, 2] forward1: [0, 2, 8, 7, 11, 16, 0, 0] forward2: [2, 8, 7, 11, 16] [2, -1, 5, 4, -1, 6, 2, 3] [-1, 5, 4, -1, 6, 2] [0, -1, 5, 9, 8, 14, 16] i: 1 24 i: 2 21 i: 3 19 i: 4 25 i: 5 5 [2, -1, 5, 4, -1, 6, 2, 3] [16, 14, 8, 9, 5, -1, 0]
Code: 10:55:25 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, forward[i-1] + A[i])
forward[i] = ending
print(A)
print("forward1: ", forward)
forward2 = []
ending = A[1]
forward2.append(ending)
for a in A[2:-2]:
ending = max(0, ending + a)
forward2.append(ending)
print("forward2: ", forward2)
A = list(reversed(A))
ending = 0
backwards = []
backwards.append(ending)
for a in A[1:-1]:
ending = max(a, ending + a)
backwards.append(ending)
print(A)
print(A[1:-1])
print(backwards)
backwards = list(reversed(backwards))
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i+1] + backwards[i-1])
print(A)
print(backwards)
return 0
Code: 10:55:37 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, forward[i-1] + A[i])
forward[i] = ending
print(A)
print("forward1: ", forward)
forward2 = []
ending = A[1]
forward2.append(ending)
for a in A[2:-2]:
ending = max(0, ending + a)
forward2.append(ending)
print("forward2: ", forward2)
for i in range(len(A)-2,):
ending = max(0, forward[i-1] + A[i])
forward[i] = ending
A = list(reversed(A))
ending = 0
backwards = []
backwards.append(ending)
for a in A[1:-1]:
ending = max(a, ending + a)
backwards.append(ending)
print(A)
print(A[1:-1])
print(backwards)
backwards = list(reversed(backwards))
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i+1] + backwards[i-1])
print(A)
print(backwards)
return 0
Code: 10:55:48 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, forward[i-1] + A[i])
forward[i] = ending
print(A)
print("forward1: ", forward)
forward2 = []
ending = A[1]
forward2.append(ending)
for a in A[2:-2]:
ending = max(0, ending + a)
forward2.append(ending)
print("forward2: ", forward2)
for i in range(len(A)-2,1,-1):
ending = max(0, forward[i-1] + A[i])
forward[i] = ending
A = list(reversed(A))
ending = 0
backwards = []
backwards.append(ending)
for a in A[1:-1]:
ending = max(a, ending + a)
backwards.append(ending)
print(A)
print(A[1:-1])
print(backwards)
backwards = list(reversed(backwards))
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i+1] + backwards[i-1])
print(A)
print(backwards)
return 0
Code: 10:55:59 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, forward[i-1] + A[i])
forward[i] = ending
print(A)
print("forward1: ", forward)
forward2 = []
ending = A[1]
forward2.append(ending)
for a in A[2:-2]:
ending = max(0, ending + a)
forward2.append(ending)
print("forward2: ", forward2)
forward = [0] * len(A)
ending = 0
for i in range(len(A)-2,1,-1):
ending = max(0, forward[i-1] + A[i])
forward[i] = ending
A = list(reversed(A))
ending = 0
backwards = []
backwards.append(ending)
for a in A[1:-1]:
ending = max(a, ending + a)
backwards.append(ending)
print(A)
print(A[1:-1])
print(backwards)
backwards = list(reversed(backwards))
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i+1] + backwards[i-1])
print(A)
print(backwards)
return 0
Code: 10:56:10 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, forward[i-1] + A[i])
forward[i] = ending
print(A)
print("forward1: ", forward)
forward2 = []
ending = A[1]
forward2.append(ending)
for a in A[2:-2]:
ending = max(0, ending + a)
forward2.append(ending)
print("forward2: ", forward2)
backwards = [0] * len(A)
ending = 0
for i in range(len(A)-2,1,-1):
ending = max(0, backwards[i-1] + A[i])
backwards[i] = ending
A = list(reversed(A))
ending = 0
backwards = []
backwards.append(ending)
for a in A[1:-1]:
ending = max(a, ending + a)
backwards.append(ending)
print(A)
print(A[1:-1])
print(backwards)
backwards = list(reversed(backwards))
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i+1] + backwards[i-1])
print(A)
print(backwards)
return 0
Code: 10:56:28 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, forward[i-1] + A[i])
forward[i] = ending
print(A)
print("forward1: ", forward)
forward2 = []
ending = A[1]
forward2.append(ending)
for a in A[2:-2]:
ending = max(0, ending + a)
forward2.append(ending)
print("forward2: ", forward2)
backwards = [0] * len(A)
ending = 0
for i in range(len(A)-2,1,-1):
ending = max(0, backwards[i-1] + A[i])
backwards[i] = ending
print(backwards)
A = list(reversed(A))
ending = 0
backwards = []
backwards.append(ending)
for a in A[1:-1]:
ending = max(a, ending + a)
backwards.append(ending)
print(A)
print(A[1:-1])
print(backwards)
backwards = list(reversed(backwards))
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i+1] + backwards[i-1])
print(A)
print(backwards)
return 0
Code: 10:56:40 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, forward[i-1] + A[i])
forward[i] = ending
print(A)
print("forward1: ", forward)
forward2 = []
ending = A[1]
forward2.append(ending)
for a in A[2:-2]:
ending = max(0, ending + a)
forward2.append(ending)
print("forward2: ", forward2)
backwards = [0] * len(A)
ending = 0
for i in range(len(A)-2,1,-1):
ending = max(0, backwards[i-1] + A[i])
backwards[i] = ending
print("backwards1:",backwards)
A = list(reversed(A))
ending = 0
backwards = []
backwards.append(ending)
for a in A[1:-1]:
ending = max(a, ending + a)
backwards.append(ending)
print(A)
print(A[1:-1])
print(backwards)
backwards = list(reversed(backwards))
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i+1] + backwards[i-1])
print(A)
print(backwards)
return 0
Code: 10:57:07 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, forward[i-1] + A[i])
forward[i] = ending
print(A)
print("forward1: ", forward)
forward2 = []
ending = A[1]
forward2.append(ending)
for a in A[2:-2]:
ending = max(0, ending + a)
forward2.append(ending)
print("forward2: ", forward2)
backwards = [0] * len(A)
ending = 0
for i in range(len(A)-2,1,-1):
ending = max(0, ending + A[i])
backwards[i] = ending
print("backwards1:",backwards)
A = list(reversed(A))
ending = 0
backwards = []
backwards.append(ending)
for a in A[1:-1]:
ending = max(a, ending + a)
backwards.append(ending)
print(A)
print(A[1:-1])
print(backwards)
backwards = list(reversed(backwards))
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i+1] + backwards[i-1])
print(A)
print(backwards)
return 0
Code: 10:57:15 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, ending + A[i])
forward[i] = ending
print(A)
print("forward1: ", forward)
forward2 = []
ending = A[1]
forward2.append(ending)
for a in A[2:-2]:
ending = max(0, ending + a)
forward2.append(ending)
print("forward2: ", forward2)
backwards = [0] * len(A)
ending = 0
for i in range(len(A)-2,1,-1):
ending = max(0, ending + A[i])
backwards[i] = ending
print("backwards1:",backwards)
A = list(reversed(A))
ending = 0
backwards = []
backwards.append(ending)
for a in A[1:-1]:
ending = max(a, ending + a)
backwards.append(ending)
print(A)
print(A[1:-1])
print(backwards)
backwards = list(reversed(backwards))
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i+1] + backwards[i-1])
print(A)
print(backwards)
return 0
Analysis
expand all
Example tests
1.
0.036 s
WRONG ANSWER,
got 0 expected 17
stdout:
[3, 2, 6, -1, 4, 5, -1, 2] forward1: [0, 2, 8, 7, 11, 16, 0, 0] forward2: [2, 8, 7, 11, 16] backwards1: [0, 0, 14, 8, 9, 5, 0, 0] [2, -1, 5, 4, -1, 6, 2, 3] [-1, 5, 4, -1, 6, 2] [0, -1, 5, 9, 8, 14, 16] i: 1 24 i: 2 21 i: 3 19 i: 4 25 i: 5 5 [2, -1, 5, 4, -1, 6, 2, 3] [16, 14, 8, 9, 5, -1, 0]
Code: 10:57:54 UTC,
py,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, ending + A[i])
forward[i] = ending
print(A)
print("forward1: ", forward)
forward2 = []
ending = A[1]
forward2.append(ending)
for a in A[2:-2]:
ending = max(0, ending + a)
forward2.append(ending)
print("forward2: ", forward2)
backwards = [0] * len(A)
ending = 0
for i in range(len(A)-2,1,-1):
ending = max(0, ending + A[i])
backwards[i] = ending
print("backwards1:",backwards)
A = list(reversed(A))
ending = 0
backwards = []
backwards.append(ending)
forward2 = []
ending = A[1]
forward2.append(ending)
for a in A[2:-2]:
ending = max(0, ending + a)
forward2.append(ending)
print("forward2: ", forward2)
print(A)
print(A[1:-1])
print(backwards)
backwards = list(reversed(backwards))
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i+1] + backwards[i-1])
print(A)
print(backwards)
return 0
Code: 10:58:04 UTC,
py,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, ending + A[i])
forward[i] = ending
print(A)
print("forward1: ", forward)
forward2 = []
ending = A[1]
forward2.append(ending)
for a in A[2:-2]:
ending = max(0, ending + a)
forward2.append(ending)
print("forward2: ", forward2)
backwards = [0] * len(A)
ending = 0
for i in range(len(A)-2,1,-1):
ending = max(0, ending + A[i])
backwards[i] = ending
print("backwards1:",backwards)
A = list(reversed(A))
ending = 0
backwards = []
backwards.append(ending)
backwards2 = []
ending = A[1]
forward2.append(ending)
for a in A[2:-2]:
ending = max(0, ending + a)
forward2.append(ending)
print("forward2: ", forward2)
print(A)
print(A[1:-1])
print(backwards)
backwards = list(reversed(backwards))
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i+1] + backwards[i-1])
print(A)
print(backwards)
return 0
Code: 10:58:15 UTC,
py,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, ending + A[i])
forward[i] = ending
print(A)
print("forward1: ", forward)
forward2 = []
ending = A[1]
forward2.append(ending)
for a in A[2:-2]:
ending = max(0, ending + a)
forward2.append(ending)
print("forward2: ", forward2)
backwards = [0] * len(A)
ending = 0
for i in range(len(A)-2,1,-1):
ending = max(0, ending + A[i])
backwards[i] = ending
print("backwards1:",backwards)
A = list(reversed(A))
ending = 0
backwards = []
backwards.append(ending)
backwards2 = []
ending = A[1]
backwards2.append(ending)
for a in A[2:-2]:
ending = max(0, ending + a)
backwards2.append(ending)
print("backwards2: ", backwards2)
print(A)
print(A[1:-1])
print(backwards)
backwards = list(reversed(backwards))
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i+1] + backwards[i-1])
print(A)
print(backwards)
return 0
Code: 10:58:23 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, ending + A[i])
forward[i] = ending
print(A)
print("forward1: ", forward)
forward2 = []
ending = A[1]
forward2.append(ending)
for a in A[2:-2]:
ending = max(0, ending + a)
forward2.append(ending)
print("forward2: ", forward2)
backwards = [0] * len(A)
ending = 0
for i in range(len(A)-2,1,-1):
ending = max(0, ending + A[i])
backwards[i] = ending
print("backwards1:",backwards)
A = list(reversed(A))
backwards2 = []
ending = A[1]
backwards2.append(ending)
for a in A[2:-2]:
ending = max(0, ending + a)
backwards2.append(ending)
print("backwards2: ", backwards2)
print(A)
print(A[1:-1])
print(backwards)
backwards = list(reversed(backwards))
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i+1] + backwards[i-1])
print(A)
print(backwards)
return 0
Code: 10:58:35 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, ending + A[i])
forward[i] = ending
print(A)
print("forward1: ", forward)
forward2 = []
ending = A[1]
forward2.append(ending)
for a in A[2:-2]:
ending = max(0, ending + a)
forward2.append(ending)
print("forward2: ", forward2)
backwards = [0] * len(A)
ending = 0
for i in range(len(A)-2,1,-1):
ending = max(0, ending + A[i])
backwards[i] = ending
print("backwards1:",backwards)
A = list(reversed(A))
backwards2 = []
ending = A[1]
backwards2.append(ending)
for a in A[2:-2]:
ending = max(0, ending + a)
backwards2.append(ending)
print("backwards2: ", backwards2)
backwards = list(reversed(backwards))
for i in range(1,len(A)-2):
print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i+1] + backwards[i-1])
print(A)
print(backwards)
return 0
Code: 10:58:46 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, ending + A[i])
forward[i] = ending
print(A)
print("forward1: ", forward)
forward2 = []
ending = A[1]
forward2.append(ending)
for a in A[2:-2]:
ending = max(0, ending + a)
forward2.append(ending)
print("forward2: ", forward2)
backwards = [0] * len(A)
ending = 0
for i in range(len(A)-2,1,-1):
ending = max(0, ending + A[i])
backwards[i] = ending
print("backwards1:",backwards)
A = list(reversed(A))
backwards2 = []
ending = A[1]
backwards2.append(ending)
for a in A[2:-2]:
ending = max(0, ending + a)
backwards2.append(ending)
print("backwards2: ", backwards2)
backwards = list(reversed(backwards))
#for i in range(1,len(A)-2):
# print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
# print(forward[i+1] + backwards[i-1])
#print(A)
#print(backwards)
return 0
Code: 10:58:57 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, ending + A[i])
forward[i] = ending
print(A)
print("forward1: ", forward)
forward2 = []
ending = A[1]
forward2.append(ending)
for a in A[2:-2]:
ending = max(0, ending + a)
forward2.append(ending)
print("forward2: ", forward2)
backwards = [0] * len(A)
ending = 0
for i in range(len(A)-2,1,-1):
ending = max(0, ending + A[i])
backwards[i] = ending
print("backwards1:",backwards)
A = list(reversed(A))
backwards2 = []
ending = A[1]
backwards2.append(ending)
for a in A[2:-2]:
ending = max(0, ending + a)
backwards2.append(ending)
print("backwards2: ", backwards2)
backwards = list(reversed(backwards))
#for i in range(1,len(A)-2):
# print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
# print(forward[i+1] + backwards[i-1])
#print(A)
#print(backwards)
return 0
Code: 10:59:10 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, ending + A[i])
forward[i] = ending
print(A)
print("forward1: ", forward)
forward2 = []
ending = A[1]
forward2.append(ending)
for a in A[2:-2]:
ending = max(0, ending + a)
forward2.append(ending)
print("forward2: ", forward2)
backwards = [0] * len(A)
ending = 0
for i in range(len(A)-2,1,-1):
ending = max(0, ending + A[i])
backwards[i] = ending
print("backwards1:",backwards)
A = list(reversed(A))
backwards2 = []
ending = A[1]
backwards2.append(ending)
for a in A[2:-2]:
ending = max(0, ending + a)
backwards2.append(ending)
print("backwards2: ", backwards2)
backwards = list(reversed(backwards))
#for i in range(1,len(A)-2):
# print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
# print(forward[i+1] + backwards[i-1])
#print(A)
#print(backwards)
return 0
Analysis
expand all
Example tests
1.
0.036 s
WRONG ANSWER,
got 0 expected 17
stdout:
[3, 2, 6, -1, 4, 5, -1, 2] forward1: [0, 2, 8, 7, 11, 16, 0, 0] forward2: [2, 8, 7, 11, 16] backwards1: [0, 0, 14, 8, 9, 5, 0, 0] backwards2: [-1, 4, 8, 7, 13]
Code: 11:01:50 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, ending + A[i])
forward[i] = ending
print(A)
print("forward1: ", forward)
forward2 = []
ending = A[1]
forward2.append(ending)
for a in A[2:-2]:
ending = max(0, ending + a)
forward2.append(ending)
print("forward2: ", forward2)
backwards = [0] * len(A)
ending = 0
for i in range(len(A)-2,1,-1):
ending = max(0, ending + A[i])
backwards[i] = ending
print("backwards1:",backwards)
A = list(reversed(A))
backwards2 = []
ending = A[1]
backwards2.append(ending)
for a in A[3:-2]:
ending = max(0, ending + a)
backwards2.append(ending)
print("backwards2: ", backwards2)
backwards = list(reversed(backwards))
#for i in range(1,len(A)-2):
# print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
# print(forward[i+1] + backwards[i-1])
#print(A)
#print(backwards)
return 0
Code: 11:01:50 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, ending + A[i])
forward[i] = ending
print(A)
print("forward1: ", forward)
forward2 = []
ending = A[1]
forward2.append(ending)
for a in A[2:-2]:
ending = max(0, ending + a)
forward2.append(ending)
print("forward2: ", forward2)
backwards = [0] * len(A)
ending = 0
for i in range(len(A)-2,1,-1):
ending = max(0, ending + A[i])
backwards[i] = ending
print("backwards1:",backwards)
A = list(reversed(A))
backwards2 = []
ending = A[1]
backwards2.append(ending)
for a in A[3:-2]:
ending = max(0, ending + a)
backwards2.append(ending)
print("backwards2: ", backwards2)
backwards = list(reversed(backwards))
#for i in range(1,len(A)-2):
# print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
# print(forward[i+1] + backwards[i-1])
#print(A)
#print(backwards)
return 0
Analysis
expand all
Example tests
1.
0.036 s
WRONG ANSWER,
got 0 expected 17
stdout:
[3, 2, 6, -1, 4, 5, -1, 2] forward1: [0, 2, 8, 7, 11, 16, 0, 0] forward2: [2, 8, 7, 11, 16] backwards1: [0, 0, 14, 8, 9, 5, 0, 0] backwards2: [-1, 3, 2, 8]
Code: 11:02:15 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, ending + A[i])
forward[i] = ending
print(A)
print("forward1: ", forward)
forward2 = []
ending = A[1]
forward2.append(ending)
for a in A[2:-2]:
ending = max(0, ending + a)
forward2.append(ending)
print("forward2: ", forward2)
backwards = [0] * len(A)
ending = 0
for i in range(len(A)-2,1,-1):
ending = max(0, ending + A[i])
backwards[i] = ending
print("backwards1:",backwards)
A = list(reversed(A))
backwards2 = []
ending = A[2]
backwards2.append(ending)
for a in A[3:-2]:
ending = max(0, ending + a)
backwards2.append(ending)
print("backwards2: ", backwards2)
backwards = list(reversed(backwards))
#for i in range(1,len(A)-2):
# print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
# print(forward[i+1] + backwards[i-1])
#print(A)
#print(backwards)
return 0
Analysis
expand all
Example tests
1.
0.036 s
WRONG ANSWER,
got 0 expected 17
stdout:
[3, 2, 6, -1, 4, 5, -1, 2] forward1: [0, 2, 8, 7, 11, 16, 0, 0] forward2: [2, 8, 7, 11, 16] backwards1: [0, 0, 14, 8, 9, 5, 0, 0] backwards2: [5, 9, 8, 14]
Code: 11:04:48 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, ending + A[i])
forward[i] = ending
print(A)
print("forward1: ", forward)
forward2 = []
ending = A[1]
forward2.append(ending)
for a in A[2:-2]:
ending = max(0, ending + a)
forward2.append(ending)
print("forward2: ", forward2)
backwards = [0] * len(A)
ending = 0
for i in range(len(A)-2,1,-1):
ending = max(0, ending + A[i])
backwards[i] = ending
print("backwards1:",backwards)
A = list(reversed(A))
backwards2 = []
ending = A[2]
backwards2.append(ending)
for a in A[3:-2]:
ending = max(0, ending + a)
backwards2.append(ending)
print("backwards2: ", backwards2)
backwards = list(reversed(backwards))
for i in range(1,len(A)-2):
# print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
# print(forward[i+1] + backwards[i-1])
#print(A)
#print(backwards)
return 0
Code: 11:05:01 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, ending + A[i])
forward[i] = ending
print(A)
print("forward1: ", forward)
forward2 = []
ending = A[1]
forward2.append(ending)
for a in A[2:-2]:
ending = max(0, ending + a)
forward2.append(ending)
print("forward2: ", forward2)
backwards = [0] * len(A)
ending = 0
for i in range(len(A)-2,1,-1):
ending = max(0, ending + A[i])
backwards[i] = ending
print("backwards1:",backwards)
A = list(reversed(A))
backwards2 = []
ending = A[2]
backwards2.append(ending)
for a in A[3:-2]:
ending = max(0, ending + a)
backwards2.append(ending)
print("backwards2: ", backwards2)
backwards = list(reversed(backwards))
for i in range(1,len(A)-2):
# print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i] + backwards[i-1])
#print(A)
#print(backwards)
return 0
Code: 11:05:11 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, ending + A[i])
forward[i] = ending
print(A)
print("forward1: ", forward)
forward2 = []
ending = A[1]
forward2.append(ending)
for a in A[2:-2]:
ending = max(0, ending + a)
forward2.append(ending)
print("forward2: ", forward2)
backwards = [0] * len(A)
ending = 0
for i in range(len(A)-2,1,-1):
ending = max(0, ending + A[i])
backwards[i] = ending
print("backwards1:",backwards)
A = list(reversed(A))
backwards2 = []
ending = A[2]
backwards2.append(ending)
for a in A[3:-2]:
ending = max(0, ending + a)
backwards2.append(ending)
print("backwards2: ", backwards2)
backwards = list(reversed(backwards))
for i in range(0,len(A)-2):
# print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i] + backwards[i-1])
#print(A)
#print(backwards)
return 0
Code: 11:05:24 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, ending + A[i])
forward[i] = ending
print(A)
print("forward1: ", forward)
forward2 = []
ending = A[1]
forward2.append(ending)
for a in A[2:-2]:
ending = max(0, ending + a)
forward2.append(ending)
print("forward2: ", forward2)
backwards = [0] * len(A)
ending = 0
for i in range(len(A)-2,1,-1):
ending = max(0, ending + A[i])
backwards[i] = ending
print("backwards1:",backwards)
A = list(reversed(A))
backwards2 = []
ending = A[2]
backwards2.append(ending)
for a in A[3:-2]:
ending = max(0, ending + a)
backwards2.append(ending)
print("backwards2: ", backwards2)
backwards = list(reversed(backwards))
for i in range(0,len(A)-2):
# print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i] + backwards[i-2])
#print(A)
#print(backwards)
return 0
Analysis
expand all
Example tests
1.
0.040 s
WRONG ANSWER,
got 0 expected 17
stdout:
[3, 2, 6, -1, 4, 5, -1, 2] forward1: [0, 2, 8, 7, 11, 16, 0, 0] forward2: [2, 8, 7, 11, 16] backwards1: [0, 0, 14, 8, 9, 5, 0, 0] backwards2: [5, 9, 8, 14] 0 2 8 7 16 25
Code: 11:05:36 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, ending + A[i])
forward[i] = ending
print(A)
print("forward1: ", forward)
forward2 = []
ending = A[1]
forward2.append(ending)
for a in A[2:-2]:
ending = max(0, ending + a)
forward2.append(ending)
print("forward2: ", forward2)
backwards = [0] * len(A)
ending = 0
for i in range(len(A)-2,1,-1):
ending = max(0, ending + A[i])
backwards[i] = ending
print("backwards1:",backwards)
A = list(reversed(A))
backwards2 = []
ending = A[2]
backwards2.append(ending)
for a in A[3:-2]:
ending = max(0, ending + a)
backwards2.append(ending)
print("backwards2: ", backwards2)
#backwards = list(reversed(backwards))
for i in range(0,len(A)-2):
# print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i] + backwards[i-2])
#print(A)
#print(backwards)
return 0
Analysis
expand all
Example tests
1.
0.036 s
WRONG ANSWER,
got 0 expected 17
stdout:
[3, 2, 6, -1, 4, 5, -1, 2] forward1: [0, 2, 8, 7, 11, 16, 0, 0] forward2: [2, 8, 7, 11, 16] backwards1: [0, 0, 14, 8, 9, 5, 0, 0] backwards2: [5, 9, 8, 14] 0 2 8 7 25 24
Code: 11:06:00 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, ending + A[i])
forward[i] = ending
print(A)
print("forward1: ", forward)
backwards = [0] * len(A)
ending = 0
for i in range(len(A)-2,1,-1):
ending = max(0, ending + A[i])
backwards[i] = ending
print("backwards1:",backwards)
A = list(reversed(A))
backwards2 = []
ending = A[2]
backwards2.append(ending)
for a in A[3:-2]:
ending = max(0, ending + a)
backwards2.append(ending)
print("backwards2: ", backwards2)
#backwards = list(reversed(backwards))
for i in range(0,len(A)-2):
# print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i] + backwards[i-2])
#print(A)
#print(backwards)
return 0
Code: 11:06:10 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, ending + A[i])
forward[i] = ending
print(A)
print("forward1: ", forward)
backwards = [0] * len(A)
ending = 0
for i in range(len(A)-2,1,-1):
ending = max(0, ending + A[i])
backwards[i] = ending
print("backwards1:",backwards)
A = list(reversed(A))
backwards2 = []
ending = A[2]
backwards2.append(ending)
for a in A[3:-2]:
ending = max(0, ending + a)
backwards2.append(ending)
print("backwards2: ", backwards2)
#backwards = list(reversed(backwards))
for i in range(0,len(A)-2):
# print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i] + backwards[i-2])
#print(A)
#print(backwards)
return 0
Code: 11:06:17 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, ending + A[i])
forward[i] = ending
print(A)
print("forward1: ", forward)
backwards = [0] * len(A)
ending = 0
for i in range(len(A)-2,1,-1):
ending = max(0, ending + A[i])
backwards[i] = ending
print("backwards1:",backwards)
#backwards = list(reversed(backwards))
for i in range(0,len(A)-2):
# print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i] + backwards[i-2])
#print(A)
#print(backwards)
return 0
Analysis
expand all
Example tests
1.
0.052 s
WRONG ANSWER,
got 0 expected 17
stdout:
[3, 2, 6, -1, 4, 5, -1, 2] forward1: [0, 2, 8, 7, 11, 16, 0, 0] backwards1: [0, 0, 14, 8, 9, 5, 0, 0] 0 2 8 7 25 24
Code: 11:08:21 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, ending + A[i])
forward[i] = ending
print(A)
print("forward1: ", forward)
backwards = [0] * len(A)
ending = 0
for i in range(len(A)-2,1,-1):
ending = max(0, ending + A[i])
backwards[i] = ending
print("backwards1:",backwards)
for i in range(0,len(A)-2):
# print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i] + backwards[i-2])
#print(A)
#print(backwards)
return 0
Code: 11:08:32 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, ending + A[i])
forward[i] = ending
print(A)
print("forward1: ", forward)
backwards = [0] * len(A)
ending = 0
for i in range(len(A)-2,1,-1):
ending = max(0, ending + A[i])
backwards[i] = ending
print("backwards1:",backwards)
max = 0
for i in range(0,len(A)-2):
# print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i] + backwards[i-2])
#print(A)
#print(backwards)
return 0
Code: 11:08:45 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, ending + A[i])
forward[i] = ending
print(A)
print("forward1: ", forward)
backwards = [0] * len(A)
ending = 0
for i in range(len(A)-2,1,-1):
ending = max(0, ending + A[i])
backwards[i] = ending
print("backwards1:",backwards)
max = 0
for i in range(0,len(A)-2):
max = max(max)
# print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i] + backwards[i-2])
#print(A)
#print(backwards)
return 0
Code: 11:08:56 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, ending + A[i])
forward[i] = ending
print(A)
print("forward1: ", forward)
backwards = [0] * len(A)
ending = 0
for i in range(len(A)-2,1,-1):
ending = max(0, ending + A[i])
backwards[i] = ending
print("backwards1:",backwards)
maxi = 0
for i in range(0,len(A)-2):
maxi = max(maxi, )
# print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i] + backwards[i-2])
#print(A)
#print(backwards)
return 0
Code: 11:09:14 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, ending + A[i])
forward[i] = ending
print(A)
print("forward1: ", forward)
backwards = [0] * len(A)
ending = 0
for i in range(len(A)-2,1,-1):
ending = max(0, ending + A[i])
backwards[i] = ending
print("backwards1:",backwards)
maxi = 0
for i in range(0,len(A)-2):
maxi = max(maxi, forward[i] + backwards[i+2])
# print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i] + backwards[i+2])
#print(A)
#print(backwards)
return 0
Code: 11:09:14 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, ending + A[i])
forward[i] = ending
print(A)
print("forward1: ", forward)
backwards = [0] * len(A)
ending = 0
for i in range(len(A)-2,1,-1):
ending = max(0, ending + A[i])
backwards[i] = ending
print("backwards1:",backwards)
maxi = 0
for i in range(0,len(A)-2):
maxi = max(maxi, forward[i] + backwards[i+2])
# print("i:", i)
#print(max_slices_forward[i+1])
#print(max_slices_backwards[i-1])
print(forward[i] + backwards[i+2])
#print(A)
#print(backwards)
return 0
Analysis
expand all
Example tests
1.
0.056 s
WRONG ANSWER,
got 0 expected 17
stdout:
[3, 2, 6, -1, 4, 5, -1, 2] forward1: [0, 2, 8, 7, 11, 16, 0, 0] backwards1: [0, 0, 14, 8, 9, 5, 0, 0] 14 10 17 12 11 16
Code: 11:09:33 UTC,
py,
verify,
result: Passed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, ending + A[i])
forward[i] = ending
print(A)
print("forward1: ", forward)
backwards = [0] * len(A)
ending = 0
for i in range(len(A)-2,1,-1):
ending = max(0, ending + A[i])
backwards[i] = ending
print("backwards1:",backwards)
maxi = 0
for i in range(0,len(A)-2):
maxi = max(maxi, forward[i] + backwards[i+2])
print(forward[i] + backwards[i+2])
return maxi
Analysis
expand all
Example tests
1.
0.036 s
OK
stdout:
[3, 2, 6, -1, 4, 5, -1, 2] forward1: [0, 2, 8, 7, 11, 16, 0, 0] backwards1: [0, 0, 14, 8, 9, 5, 0, 0] 14 10 17 12 11 16
Code: 11:09:54 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, ending + A[i])
forward[i] = ending
print(A)
print("forward1: ", forward)
backwards = [0] * len(A)
ending = 0
for i in range(len(A)-2,1,-1):
ending = max(0, ending + A[i])
backwards[i] = ending
maxi = 0
for i in range(0,len(A)-2):
maxi = max(maxi, forward[i] + backwards[i+2])
print(forward[i] + backwards[i+2])
return maxi
Code: 11:10:08 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, ending + A[i])
forward[i] = ending
backwards = [0] * len(A)
ending = 0
for i in range(len(A)-2,1,-1):
ending = max(0, ending + A[i])
backwards[i] = ending
maxi = 0
for i in range(0,len(A)-2):
maxi = max(maxi, forward[i] + backwards[i+2])
return maxi
Code: 11:10:24 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, ending + A[i])
forward[i] = ending
backwards = [0] * len(A)
ending = 0
for i in range(len(A)-2,1,-1):
ending = max(0, ending + A[i])
backwards[i] = ending
maxi = 0
for i in range(0,len(A)-2):
maxi = max(maxi, forward[i] + backwards[i+2])
return maxi
Code: 11:10:47 UTC,
py,
verify,
result: Passed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, ending + A[i])
forward[i] = ending
backwards = [0] * len(A)
ending = 0
for i in range(len(A)-2,1,-1):
ending = max(0, ending + A[i])
backwards[i] = ending
maxi = 0
for i in range(0,len(A)-2):
maxi = max(maxi, forward[i] + backwards[i+2])
return maxi
Analysis
Code: 11:10:52 UTC,
py,
verify,
result: Passed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, ending + A[i])
forward[i] = ending
backwards = [0] * len(A)
ending = 0
for i in range(len(A)-2,1,-1):
ending = max(0, ending + A[i])
backwards[i] = ending
maxi = 0
for i in range(0,len(A)-2):
maxi = max(maxi, forward[i] + backwards[i+2])
return maxi
Analysis
Code: 11:10:54 UTC,
py,
final,
score:
100
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
forward = [0] * len(A)
ending = 0
for i in range(1,len(A)-2):
ending = max(0, ending + A[i])
forward[i] = ending
backwards = [0] * len(A)
ending = 0
for i in range(len(A)-2,1,-1):
ending = max(0, ending + A[i])
backwards[i] = ending
maxi = 0
for i in range(0,len(A)-2):
maxi = max(maxi, forward[i] + backwards[i+2])
return maxiAnalysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(N)
expand all
Correctness tests
1.
0.036 s
OK
2.
0.036 s
OK
3.
0.036 s
OK
1.
0.036 s
OK
2.
0.036 s
OK
1.
0.036 s
OK
1.
0.036 s
OK
1.
0.036 s
OK
1.
0.036 s
OK
expand all
Performance tests
1.
0.036 s
OK
1.
0.036 s
OK
1.
0.040 s
OK
1.
0.224 s
OK
1.
0.224 s
OK
1.
0.228 s
OK
1.
0.200 s
OK
2.
0.248 s
OK