摘要: 3054: FatMouse and Cheese 时间限制(普通/Java):1000MS/3000MS 内存限制:65536KByte总提交: 129 测试通过:78 描述 FatMouse has stored some cheese in a city. The city can be co 阅读全文
posted @ 2017-08-11 10:55 淡蓝色光 阅读(206) 评论(0) 推荐(0) 编辑
摘要: 描述 You're given a tree with weights of each node, you need to find the maximum subtree of specified size of this tree. Tree Definition A tree is a con 阅读全文
posted @ 2017-08-11 10:48 淡蓝色光 阅读(189) 评论(0) 推荐(0) 编辑