| Title |
User |
Message |
Date Posted |
| Hint |
AboAlmanal |
Try solving it in O(n^2) complexity, then you can convert it to O(N*LOG(N)) using Data structure. |
Sep 24, 2016 - 10:43:29 am UTC |
| FYI to everybody |
kobortor |
The dominos aren't sorted by position. |
Jul 09, 2016 - 2:48:14 am UTC |
| Hint |
hansonw1 |
Make a recursive function f(n) that gives the minimum # of moves required to topple the first n dominoes. Now how do you relate f(n) to previous values of f? Domino #n has two choices: go left (in wh... |
Dec 06, 2008 - 3:31:22 am UTC |
