OJ Board

I've got still WA!

Please, help me.

My code answer correct all post's cases.

I found the solution without binary search! Thanks Adrian!

I've got still WA. Please, help me.

Thanks, i got AC now!

I've got TLE with DP, complexity O(n^3), in the reality n^3 * 9!
Can somebody explain a better solution?
Some hint, please!

Now I understood my mistake!
The third case can't be 1(-1) because the left subtree sum must be maximal!

Silly error!

I got AC now, however I continue with doubts!

Try it: 8 1 0 6 0 0 0 0 0 0 2 -1 1 4 -1 1 -1 1 5 -10 2 2 3 3 6 3 3 2 1 1 -10 9 -4 -3 -2 -1 0 1 2 3 4 10 5 4 3 2 1 -1 -2 -3 -4 -5 My AC Code's Answer: Case #1: 0 Case #2: 0(0(0(0(0(0))))) Case #3: -1(1) Case #4: 1(-1(-1,1)) Case #5: 3(3(-10(2(2)))) Case #6: 3(3(-10(1(1,2)))) Case #7: -4(4(-3(3(-2(2(...

There is some special test case for this problem?
I got WA!
Some hint?
Please!

I've got AC now!

I not found my mistake. I've got several WA .

Some hint?

This is my code:

I've got AC now!

I' ve got WA and don't see my error!

This is my code: Can somebody help me?

Thanks, i got AC now!

I've got WA!! Can somebody help me??
I want tests cases, please!!!

This my code: