CareerCup

Is it expected that this will be done in any more efficient way than evaluating all possibilities?

Does adding -and / make any difference to the algorithm?

Dipankar, can you post the heuristics which are applied in the standard DP solution?

This is a problem from the book: "Algorithms for interviews".

E(i) = e yi{xi+1} if e > 1 and xi+1 > 1 then yi = *
= if e > 1 and 0 >= xi+1 <1 then yi = /
= if e > 1 and 0< xi+1 then yi = +

= if 0 > e < 1 and xi +1 > 1 then yi = *
= if 0 > e < 1 and 0>= xi +1 < 1 then yi = /
= if 0> e < 1 and 0 < xi+1 then yi = +

= if 0 < e and xi +1 > 1 then yi =+
= if 0 < e and xi +1 < 1 then yi =-
= if 0 < e and xi +1 < 0 then yi = *