摘要:
链接: https://vjudge.net/problem/HYSBZ 4033 题意: 有一棵点数为N的树,树边有边权。给你一个在0~N之内的正整数K,你要在这棵树中选择K个点,将其染成黑色,并 将其他的N K个点染成白色。将所有点染色后,你会获得黑点两两之间的距离加上白点两两之间距离的和的收益 阅读全文
posted @ 2019-08-22 14:42
YDDDD
阅读(156)
评论(0)
推荐(0)
摘要:
链接: https://vjudge.net/problem/CodeForces 916C 题意: Jamie has recently found undirected weighted graphs with the following properties very interesting: 阅读全文
posted @ 2019-08-22 09:04
YDDDD
阅读(183)
评论(0)
推荐(0)

浙公网安备 33010602011771号