TC CsCourses

From Algorithmist
Jump to navigation Jump to search

Summary[edit]

Compute the lexicographically-minimal way to graduate! A relatively straightforward dynamic programming problem with backtracking. A little thinking gets the time down to which is enough for .

From TopCoder Single Round Match 340.