求验证
by lzyqwq @ 2022-05-28 10:44:21
@[蒟蒻·廖子阳](/user/539211) 可以（即答
by SunSkydp @ 2022-05-28 10:52:05
@[SunSkydp](/user/375241) .
by lzyqwq @ 2022-05-28 10:52:34
其实这题就是DAG求最长链，拓扑dp和dfs dp是本质相同的吧
by Z_301 @ 2022-05-28 11:01:42
@[蒟蒻·廖子阳](/user/539211) 本质上如果你考虑 dfs 做拓扑排序的话你会发现没有区别
by UnyieldingTrilobite @ 2022-05-28 11:18:28
@[UnyieldingTrilobite](/user/250637) @[Z_301](/user/175087) 感激不尽
by lzyqwq @ 2022-05-28 11:33:22