black_red_cragon
- 1
- 0
Hi 
This is a simple algothim problem,please help me solve it .I think its a greedy problem
Here it is:
-------------------
A native austratial named anatjari wants to cross a desert carrying only one bottle of water.He has a map that marks all the watering holes along the way .Assuming he can walk k miles on one bottle,design an eff. algo for determining where anatjari should stop to minimize the num of stops.
--------------------
It is not clear how the holes are marked in the map so i am assuming the desert to be a long straight path.
Any help would be appreciated.
TIA.
r_b_cragon
This is a simple algothim problem,please help me solve it .I think its a greedy problem
Here it is:
-------------------
A native austratial named anatjari wants to cross a desert carrying only one bottle of water.He has a map that marks all the watering holes along the way .Assuming he can walk k miles on one bottle,design an eff. algo for determining where anatjari should stop to minimize the num of stops.
--------------------
It is not clear how the holes are marked in the map so i am assuming the desert to be a long straight path.
Any help would be appreciated.
TIA.
r_b_cragon