last = 0
best = 0
i = 0

while (i < size) loop
h = g[i]
t = h + last

last = h v t
best = best v last

i = (i + 1)

end

result = best