From a1be4b3c88b04c501d68aa77afba06f0fc6483e4 Mon Sep 17 00:00:00 2001 From: caoash Date: Wed, 10 Jun 2020 20:25:17 -0500 Subject: [PATCH] minor additions to DP on trees --- content/5_Gold/8_Gold_DP_Trees.md | 12 ++++++++++-- 1 file changed, 10 insertions(+), 2 deletions(-) diff --git a/content/5_Gold/8_Gold_DP_Trees.md b/content/5_Gold/8_Gold_DP_Trees.md index a0ce8e2..d672ac8 100644 --- a/content/5_Gold/8_Gold_DP_Trees.md +++ b/content/5_Gold/8_Gold_DP_Trees.md @@ -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. \ No newline at end of file + * 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)