Tim Korb's Home Page

User Tools

Site Tools

Trace:
contest_2010-10-14

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision		Previous revision
Last revisionBoth sides next revision
contest_2010-10-14 [2010/10/14 12:01] – jtkorbcontest_2010-10-14 [2010/10/15 04:25] – jtkorb
Line 14: Line 14:
   * Team 4: Abram, John B, Tim   * Team 4: Abram, John B, Tim
   * Team 5: Alex, Eric, Dylan   * Team 5: Alex, Eric, Dylan
- 
 ===== Problems ===== ===== Problems =====
  
Line 22: Line 21:
   * D: [[http://www.programming-challenges.com/pg.php?page=downloadproblem&probid=111105&format=html|Cutting Sticks]]   * D: [[http://www.programming-challenges.com/pg.php?page=downloadproblem&probid=111105&format=html|Cutting Sticks]]
  
 +**Notes:**
 +
 +  * A: Recursive walk of the graph will do.  Use a marker to keep track of nodes you've already visited.
 +  * B: Tricky.  Use Dijkstra's (or possibly Floyd's) algorithm multiple times.
 +  * C: Dynamic programming.  Sort and find recurrence.  (Actually, simple iteration works, too.)
 +  * D: Dynamic programming.  Use divide and conquer trying each possible initial slice in turn.
contest_2010-10-14.txt · Last modified: 2010/10/15 05:15 by jtkorb