Greatest subsequential sum: Difference between revisions
Content deleted Content added
No edit summary |
m added a ;Task: (bold) header, added other whitespace and highlighting to the task's preamble. |
||
| Line 1: | Line 1: | ||
{{task}} |
|||
[[Category:Arithmetic operations]] |
|||
;Task: |
|||
Given a sequence of integers, find a continuous subsequence which maximizes the sum of its elements, that is, the elements of no other single subsequence add up to a value larger than this one. |
Given a sequence of integers, find a continuous subsequence which maximizes the sum of its elements, that is, the elements of no other single subsequence add up to a value larger than this one. |
||
An empty subsequence is considered to have the sum 0; thus if all elements are negative, the result must be the empty sequence. |
An empty subsequence is considered to have the sum '''0'''; thus if all elements are negative, the result must be the empty sequence. |
||
<br><br> |
<br><br> |
||