Those who have passion for programming,algorithm,maths and particularly solving problem with computer.
This is online judges solutions and some help for new programmers
Tuesday, June 11, 2013
990 Diving for Gold
This is same as Knapsack 0/1 (maximize profit with using time < given amount of time)
This problem can be considered as little bit harder because reconstruction of solution is also required here for that purpose we are going to have 2-D(number of element as rows and time as column) boolean array which tells us that whether we have taken element with current row ndex.