Help needed in Coin Collector-CSES Problem Set

Правка en1, от YGBoss007, 2020-09-23 11:13:32

Your text to link here... My logic is as follows: First of all, we can get all the SCC's of the graph with their respective sums. Now we can make a condensed graph sort of thing, where each SCC acts as a node. I'm not able to get what to do after that? I gave a hard thought of maintaining DP after that but couldn't get on with the recurrence relations. Any help would be appreciated.

Теги #graphs


  Rev. Язык Кто Когда Δ Комментарий
en1 Английский YGBoss007 2020-09-23 11:13:32 477 Initial revision (published)