Viewing insights from Codeforces 1746D: Paths on the Tree that are similar (thus shared) with only this insight from Codeforces 1370D: Odd-Even Subsequence: When choosing elements from a list whose indices MUST have certain separation, consider using dynamic programming (DP). by mathmastersd
- Take advantage when there are TWO choices available for some objects. This can be an indication to use DP. Consider storing the difference between the two choices and sorting to determine the optimal choices. by mathmastersd
- A greedy strategy for graphs (and probably more generally) is to first take care of things at the bottom that will NOT affect others. Then, work your way upwards. by mathmastersd
Page 1 of 1.
View links to all pages
1About • Privacy Notice • Rules • Problems list • Journal • Your profile • GitHub
Moon Symbol icon by Icons8 • Sun icon by Icons8 • Emojis from Twemoji by Twitter under CC by 4.0