I use segment tree to solve this problems(O(n^2logn)).
And I have checked my program with an solution(already accepted) for many times.
All my answer is correct.
But still wa#2.
Sorry for my poor English.
Please help me,Thank you.

After I have correct my code.
I got wa#85 now!!!
faint!
Who can help me?

For WA #2 one should make sure that the Segment Tree is initialized to -INF.