algorithm - Ideas for Building Bridges on topcoder DIV1-1000 -


i practicing topcoder when encountered following problem:

http://community.topcoder.com/stat?c=problem_statement&pm=13417&rd=16464

i in div2 constraints easier, brute force checking each of possible bridge location worked. tried hard think div 1 problem (n<=200) , brute force never pass. can't think of straight forward way can not apply dp or greedy or know. glad if give pointers or hints correct direction problem. on other forums people seem going brute force approach.


Comments

Popular posts from this blog

qt - Using float or double for own QML classes -

Create Outlook appointment via C# .Net -

ios - Swift Array Resetting Itself -