本文通过一道CodeForces题目，详细介绍了如何寻找一张图中最大美丽度的刺猬（尾巴长度乘以尾巴末端点的度数）。解题思路包括统计点的度数，建立单向图，并利用DFS从最小序号点开始搜索，优化递归过程，避免无效更新。最后，计算每个点的长度和度数，以找到最大值。
提交链接：CF 615B
题面：
B. Longtail Hedgehog
time limit per test
3 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
This Christmas Santa gave Masha a magic picture and a pencil. The picture consists ofn points connected by m segments (they might cross in any way, that doesn't matter). No two segments connect the same pair of points, and no segment connects the point to itself. Masha wants to color some segments in order paint a hedgehog. In Mashas mind every hedgehog consists of a tail an
最低0.47元/天 解锁文章
915
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
