Version 1.3.0, Problem 6.4 (1.) Description is there in the book, but algorithm is missing

[GoogleCodeExporter]

Hi 
I am using 1.3.0 version of the book. I recently bought it and have been 
studying the problems. Currently,I am studying Problem 6.4 (1.) "Compute 
Maximum Value of (A[j0]-A[i0]) + (A[j1]-A[i1]), subject to i0<j0<i1<j1".

I could see Problem 6.4(1.) description (book version 1.3.0), but could not 
figure out the algorithm from the description. Could you please provide the 
algorithm here?

Regards
Thameeem

Original issue reported on code.google.com by [email protected] on 7 Jan 2014 at 11:26

[GoogleCodeExporter]

Hey Thameem,

Sorry for my late reply. Do you mean you want the code for Problem 6.4(1.)? 
Because I think we have already provide the algorithm for it.

Original comment by [email protected] on 13 Jan 2014 at 1:55