contest_2011-09-20
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revision | Next revisionBoth sides next revision | ||
| contest_2011-09-20 [2011/09/20 10:21] – jtkorb | contest_2011-09-20 [2011/09/20 11:14] – jtkorb | ||
|---|---|---|---|
| Line 26: | Line 26: | ||
| * D: The solution to this problem is almost the same as the main problem. | * D: The solution to this problem is almost the same as the main problem. | ||
| * E: Pre-compute a run-length encoded array to represent f, then do a binary search to find f(n). | * E: Pre-compute a run-length encoded array to represent f, then do a binary search to find f(n). | ||
| - | * F: A brute force solution (trying all values of k between 1 and n) works for the contest test data. You'll need a more efficient solution to get it past the UVA judge in three seconds. | + | * F: A brute force solution (trying all values of k between 1 and n) works for the contest test data. You'll need a more efficient solution to get it past the UVA judge in ten seconds. |
contest_2011-09-20.txt · Last modified: 2011/09/20 14:33 by jtkorb