wcc 12.24

Main.hs

import Data.List

longestSubset xs = last $ sortBy summing $ subsets xs
  where subsets = concatMap inits . tails
        summing x y = sum x `compare` sum y


main = do
  let arry = [(-2), 1, (-3), 4, (-1), 2, 1, (-5), 4]
  print $ longestSubset arry