a/usaco-guide
Archived
1
0
Fork 0
Code Issues Pull requests Packages Projects Releases Wiki Activity

minor additions to DP on trees

Browse source
This commit is contained in:
Michael Cao 2020-06-10 20:25:17 -05:00
parent 1d10439d7d
commit a1be4b3c88
1 changed files with 10 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

12
content/5_Gold/8_Gold_DP_Trees.md
View file

@ -15,13 +15,21 @@ prerequisites:
## Tutorial
* [DP on Trees (Codeforces)](https://codeforces.com/blog/entry/20935)
* ??
* [NOI PDF](https://noi.ph/training/weekly/week5.pdf)
## Problems
[[info | Pro Tip]]
| Don't just dive into trying to figure out a DP state and transitions -- make some observations if you don't see any obvious DP solution!
* [Subtree](https://atcoder.jp/contests/dp/tasks/dp_v)
* [Independent Set](https://atcoder.jp/contests/dp/tasks/dp_p)
* [Gold - Barn Painting](http://www.usaco.org/index.php?page=viewproblem2&cpid=766)
* Similar to Independent Set
* [Gold - Delegation](http://usaco.org/index.php?page=viewproblem2&cpid=1019)
* Good rule of solving DP problems applies here: don't just dive into trying to figure out a DP state and transitions, and make some observations about the problem first.
* Pretty much a greedy problem.
* [BOI - Cat In A Tree](https://cses.fi/file/a904421da451fbe1b60f96a27256832a011825dfd097ee40184d15878e837018/)
* Observations first.
* [COCI - Dzumbus](https://oj.uz/problem/view/COCI19_dzumbus)
* Solve child subtree by subtree. Runtime may be faster than you think.
* [Ostap and Tree](https://codeforces.com/problemset/problem/735/E)