数据结构_图_prime_最小生成树
Jianbagengmu
换了id,换了我的人生的态度.
展开
-
poj_2031_已连接部分点的最小生成树_prime
Building a Space Station Time Limit: 1000msMemory Limit: 30000KB This problem will be judged on PKU. Original ID: 2031 64-bit integer IO format: %lld Java class name: Main Prev Submit Status St原创 2017-11-28 21:48:34 · 314 阅读 · 0 评论 -
hdu_2682_prime
TreeThere are N (2<=N<=600) cities,each has a value of happiness,we consider two cities A and B whose value of happiness are VA and VB,if VA is a prime number,or VB is a prime number or (VA+VB) is a pr原创 2017-11-30 19:40:11 · 258 阅读 · 0 评论 -
hdu_1102_prime
Constructing RoadsProblem Description There are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to each other. We say two village A原创 2017-11-30 20:17:41 · 180 阅读 · 0 评论 -
poj_1258_prime_就是dj减配版
Agri-NetFarmer John has been elected mayor of his town! One of his campaign promises was to bring internet connectivity to all farms in the area. He needs your help, of course. Farmer John ordered a原创 2017-11-26 22:11:50 · 154 阅读 · 0 评论 -
poj_1287_prime
NetworkingYou are assigned to design network connections between certain points in a wide area. You are given a set of points in the area, and a set of possible routes for the cables that may connect p原创 2017-11-26 22:17:59 · 224 阅读 · 0 评论 -
poj_1751_The Unique MST_prime输出部分路径
The island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has a very poor system of public highways. The Flatopian government is aware of this problem and has already constructed a numbe原创 2017-12-15 21:19:42 · 198 阅读 · 0 评论 -
poj_1679_判断最小生成树是否唯一
The Unique MSTDefinition 1 (Spanning Tree): Consider a connected, undirected graph G = (V, E). A spanning tree of G is a subgraph of G, say T = (V’, E’), with the following properties: 1. V’ = V. 2原创 2017-12-17 10:13:53 · 255 阅读 · 0 评论