Live2d Test Env
2018年10月20日
HDU - 6178:Monkeys （贪心&树上最大匹配输&输入优化）
摘要： There is a tree having N vertices. In the tree there are K monkeys (K <= N). A vertex can be occupied by at most one monkey. They want to remove some 阅读全文
posted @ 2018-10-20 21:19 nimphy 阅读(380) 评论(0) 推荐(0) 编辑