最小生成树
一条很咸的鱼
这个作者很懒,什么都没留下…
展开
-
cf-ronnd-600-F-Cheap Robot
Cheap Robot You’re given a simple, undirected, connected, weighted graph with n nodes and m edges. Nodes are numbered from 1 to n. There are exactly k centrals (recharge points), which are nodes 1,2,…...原创 2019-11-18 19:30:03 · 156 阅读 · 0 评论 -
POJ3723
Description 链接 Windy has a country, and he wants to build an army to protect his country. He has picked up N girls and M boys and wants to collect them to be his soldiers. To collect a soldier without...原创 2019-07-12 13:08:58 · 391 阅读 · 0 评论