$ Pts44 $
For each run once asked a tree $ dp $
$ Pts64 $
In the case of chain, $ a $ and $ b $ adjacent.
Suppose $ a <b $
$ Years = f [1 a] + g [b, n] $
We can scratch that can be drawn from the last to do it again $ dp $.
Similar $ $ a = 1
· Defend the kingdom
Guess you like
Origin www.cnblogs.com/lxzl/p/11565865.html
Ranking