Re: [algogeeks] clearing n-stages of a game.

2013-05-27 Thread bharat b
http://stackoverflow.com/questions/14686745/guards-and-demand/14687760#14687760 On Sun, May 5, 2013 at 9:44 AM, rohit jangid rohit.nsi...@gmail.com wrote: a very standard dp problem . try to formulate recurrence relation . it has been mentioned a couple of times on stackoverflow as well . On

[algogeeks] clearing n-stages of a game.

2013-05-04 Thread sreekanth guru
There n stages of a game. At each stage i you will come across a devil. Each devil has its own energy E(i) and price P(i). If you have energy X which is greater than the devils energy at that stage you can win over the devil without any energy loss or You just pay the price to devil then it will

Re: [algogeeks] clearing n-stages of a game.

2013-05-04 Thread rohit jangid
a very standard dp problem . try to formulate recurrence relation . it has been mentioned a couple of times on stackoverflow as well . On May 5, 2013 8:28 AM, sreekanth guru sreekanth.i...@gmail.com wrote: There n stages of a game. At each stage i you will come across a devil. Each devil has