2025-06-11 20:16:52 -04:00
|
|
|
proc max_subseq &seq[] &start &stop &maxsum .
|
2024-07-13 15:19:22 -07:00
|
|
|
maxsum = 0
|
|
|
|
|
i = 1
|
|
|
|
|
start = 1
|
|
|
|
|
stop = 0
|
|
|
|
|
for j to len seq[]
|
|
|
|
|
sum += seq[j]
|
|
|
|
|
if sum < 0
|
|
|
|
|
i = j + 1
|
|
|
|
|
sum = 0
|
|
|
|
|
elif sum > maxsum
|
|
|
|
|
start = i
|
|
|
|
|
stop = j
|
|
|
|
|
maxsum = sum
|
|
|
|
|
.
|
|
|
|
|
.
|
|
|
|
|
.
|
|
|
|
|
a[] = [ -1 -2 3 5 6 -2 -1 4 -4 2 -1 ]
|
|
|
|
|
max_subseq a[] a b sum
|
|
|
|
|
print "Max sum = " & sum
|
2025-06-11 20:16:52 -04:00
|
|
|
for i = a to b : write a[i] & " "
|
