more details?
>
> thanks,
>
> On Oct 8, 2:27 am, Jun <[EMAIL PROTECTED]> wrote:
>
>
>
> > You can first solve the 1-dimension similar problem using DP. That's,
> > find the maximum sum of continuous sub sequence of an array. Then you
> > can ap
You can first solve the 1-dimension similar problem using DP. That's,
find the maximum sum of continuous sub sequence of an array. Then you
can apply this to 2-dimension problem. That's exactly your problem.
The time complexity is O(n^3).
On Oct 8, 2:04 pm, megha <[EMAIL PROTECTED]> wrote:
> give
I already know how to solve it.
Binary Index Tree is good approach to solve this problem. Thanks very
body involved in this discussion!
On Sep 22, 6:31 am, KK <[EMAIL PROTECTED]> wrote:
> On Sep 5, 11:07 am, jliang <[EMAIL PROTECTED]> wrote:
>
> > how about a doubled linked list where you can re
