摘要: Farthest Nodes in a Tree Given a tree (a connected graph with no cycles), you have to find the farthest nodes in the tree. The edges of the tree are w 阅读全文
posted @ 2020-11-10 23:08 RioTian 阅读(306) 评论(0) 推荐(1) 编辑
摘要: 复健,时间有限题解比较简陋 A. Middle of the Contest 将小时转成分钟,得到起止时间在一天中的分钟数,取平均值即可,复杂度O(1)。平均值转换会时间的时候注意前导0。 void solve(int x) { x /= 2; printf("%02d:%02d\n", x / 6 阅读全文
posted @ 2020-11-10 22:01 RioTian 阅读(172) 评论(0) 推荐(1) 编辑