Given 2d array with numbers inside each cell, you should maximize the cost to get from top left
(1,1) to bottom right
(N,M) with three paths, When you pass to cell
(i,j) the cost inside it will be removed for the next paths.
You're only allowed to move down or right.
How can I solve something like this?
I've read the tutorial here TopCoder Tutorial but I didn't understand the whole concept.