testing some data

binaryMaximumInterval.hs

import Data.List
binaryArray n = a [] n

a list 0 = [list]
a list n = (a (0:list) (n-1))++(a (1:list) (n-1))

f list = map (fx list) [1..length list]

fx list j = 1 + (length (takeWhile ((/=) (maximum result)) result))
  where result = map (sum . (take j) . (flip drop list)) [0..(length list)-j]

g n = length (map head ((group . sort) (map f (binaryArray n))))