Raouf Ould Ali - Algerian Olympiad in Informatics
The Incarnadine Training - Incarnadine IV
Dynamic Programming on Trees
Problemset
© Raouf Ould Ali - Algerian Olympiad in Informatics 1
The Incarnadine Training Dynamic Programming on Trees
Introduction 💡
In this unit, you will be given some problems that may involve DP on graphs. I said may because
DP is the easiest way, but if you’re as crazy as me, you can do it without DP! Enjoy!
Problems 📚
60 points per problem for a total of 420. I hope you enjoy mixing DP with graphs!
• Codeforces - 161D
• CSES - Longest Flight Route
• CSES - Flight Routes
• Codeforces - 839C
• AtCoder - DP P
• CSES - Tree Matching
• Codeforces - 766E
© Raouf Ould Ali - Algerian Olympiad in Informatics 2