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
contest_2010-10-14 [2010/10/15 04:25] – jtkorbcontest_2010-10-14 [2010/10/15 05:15] (current) – jtkorb
Line 26: Line 26:
   * B: Tricky.  Use Dijkstra's (or possibly Floyd's) algorithm multiple times.   * B: Tricky.  Use Dijkstra's (or possibly Floyd's) algorithm multiple times.
   * C: Dynamic programming.  Sort and find recurrence.  (Actually, simple iteration works, too.)   * 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.+  * D: Dynamic programming.  Use recursive divide and conquer trying each possible initial slice in turn.
contest_2010-10-14.1287141949.txt.gz · Last modified: 2010/10/15 04:25 by jtkorb