Hello everyone
After concluding my DP and Graph Theory playlist on YouTube, I just started a DP on Trees playlist where I plan to post my solutions to intermediate level DP on Trees problems from various sources every 2nd day during the month of July 2021.
Here are the links to my playlists:
DP Playlist (18 problems discussed)
Graph Theory playlist (12 problems discussed)
DP on Trees playlist (current)
I have uploaded 2 tutorials on DP on Trees in case you are new to the topic:
The problem list is as under:
1) Parsa's Humongous Tree (Round 722 Div 1 A Rated 1600)
2) Choosing Capital for Treeland (Round 135 Div 2 D Rated 1700)
3) CSES Tree Diameter
4) The Fair Nut and the Best Path (Round 526 Div 1 A Rated 1800)
5) Eternal Victory (Round 57 Div 2 D Rated 1800)
6) Distance in Tree (VK Cup 2012 D Rated 1800)
7) Bakry and Partitioning (Round 746 Div 2 C)
I hope this helps some of you.
Thanks much! Can you add more problems to dp on trees playlist. Thanks again.
Yes — the plan is to add a problem every two days.
Great explanations throughout the video series. could you add more problems, or maybe do videos where you give hints to problems instead of complete solutions?
Sorry for the delay — I added the 6th problem just now. I will try to post more solutions or hint videos for future problems.
Thanks a lot for this tutorial. It would be great if you post some tutorial that connected with the technique "meet-in-the-middle", it is difficult to find useful information on this topic on the internet.
Meet in the middle is a topic that is very less covered and is also very less used in CP. I know only 2 problems which use this technique —
1) CSES Problem
2) Central European Olympiad in Informatics Problem
So thats why I dont think it is very important in CP but I will make one if you insist. Also Gaurav Sen explains it in this video so you can learn from this video:
Meet in the middle algorithm