Skip to content

Instantly share code, notes, and snippets.

@jdh30

jdh30/MaxSumSubseq.tq

Created November 21, 2022 16:09
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save jdh30/f2addf96672de061e5d46b0c0ee553d5 to your computer and use it in GitHub Desktop.
Save jdh30/f2addf96672de061e5d46b0c0ee553d5 to your computer and use it in GitHub Desktop.
Download ZIP
Maximum sum subsequence
Raw
MaxSumSubseq.tq
let maxSumSubseq a =
let maxm = Array.fold [a, b -> max a b] 0 a in
let rec loop sum i =
if i = # a then sum else
let ai = Array.get a i in
if ai > 0 then loop (sum + ai) (i+1) else loop sum (i+1) in
loop 0 0
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment