OJ Board

I have solved this problem in O(n^3).
Thanks anyway.
More detail can refer to link follows:
http://acm.uva.es/board/viewtopic.php?t ... 29d16d017f

I have solved the problem 108 (in 0.5XXX sec).
Make some slight modification on the souce code, however, get TLE on this problem.

I think my algo takes O(n^4) at worst case.

Can anyone help?

I can explain my algo in a simple way follows:

1. The method to find maximum sum in array is same as 108 ...