more minor DP changes
This commit is contained in:
parent
2b3515c107
commit
05a973d35f
2 changed files with 6 additions and 1 deletions
|
@ -39,7 +39,11 @@ Practice makes perfect. Start by doing some classical problems (try at least one
|
|||
* also very good!
|
||||
* [Codeforces DP Problem List](http://codeforces.com/blog/entry/325)
|
||||
|
||||
The following USACO problems don't fall into (arranged roughly in order of difficulty).
|
||||
The following USACO problems don't fall into any of the categories below. Arranged roughly in order of difficulty.
|
||||
|
||||
|
||||
[[info | Pro Tip]]
|
||||
| Sometimes it's a good idea to write a slower polynomial-time solution and then optimize it to the desired complexity (say, write $O(N^2)$ first and then speed it up to $O(N)$).
|
||||
|
||||
* [Hoof Paper Scissors](http://www.usaco.org/index.php?page=viewproblem2&cpid=694)
|
||||
* `dp[first i games][# changes][last gesture] -> max games won`
|
||||
|
|
|
@ -14,5 +14,6 @@ prerequisites:
|
|||
|
||||
* [Gold - 248](http://www.usaco.org/index.php?page=viewproblem2&cpid=647)
|
||||
* more straightforward
|
||||
* [CF Zuma](https://codeforces.com/problemset/problem/607/B)
|
||||
* [Plat - Greedy Pie Eaters](http://www.usaco.org/index.php?page=viewproblem2&cpid=972)
|
||||
* [Plat - Subsequence Reversal](http://www.usaco.org/index.php?page=viewproblem2&cpid=698)
|
Reference in a new issue