project euler problem 149

Searching for a maximum-sum subsequence

I do not like this problem. Probably because that it is too random and cannot create enough tricks to avoid some sort of lazy programming.  I followed the algorithm in CLRS and got it in 0.8 second.