contiguousSum.hs

import Data.List (inits, tails, sortBy)
import Data.Ord (comparing)

type Result = ([Int], Int)

cSum :: [Int] -> [Result]
cSum = reverse . sortBy (comparing snd) . map result . cSubs
  where
    result xs = (xs, sum xs)
    cSubs = concatMap (tail . inits) . tails

--λ> cSum [1, 2, 3]
-- [([1,2,3],6),([2,3],5),([3],3),([1,2],3),([2],2),([1],1)]