![](https://img-blog.csdnimg.cn/20201014180756926.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
树形DP
至此曾经
从未坚持?
展开
-
hdu 6201 transaction transaction transaction
Problem Description Kelukin is a businessman. Every day, he travels around cities to do some business. On August 17th, in memory of a great man, citizens will read a book named "the Man Who Changed C原创 2017-09-10 22:19:30 · 210 阅读 · 0 评论 -
牛客网暑期ACM多校训练营(第二场)H travel
看大神的思路很清晰 https://blog.csdn.net/WuBaizhe/article/details/81153513 重点就是这个 sum[k][i][j]sum[k][i][j]:前kk个儿子所构成的子树林包含jj条不相交路径和ii条以根为端点的不相交链的最大值 则根据以第kk个儿子为根的子树贡献路径的情况,sum[k]sum[k]的值可以由sum[k−1]sum[k−1]转移...原创 2018-07-24 16:05:09 · 189 阅读 · 0 评论