Monday, March 4, 2013
You have N guards in a line each with a demand of coins.You can skip paying a guard only if his demand is lesser than what you have totally paid before reaching him.Find the least number of coins you spend to cross all guards
Labels:Data
Dynamic Programming
Subscribe to:
Post Comments
(
Atom
)
No comments :
Post a Comment