把爱恨和最大距离视为限制条件,可以知道,最大距离和限制条件多少具有单调性 所以可以二分最大距离,加边+check ...
分类：
其他好文 时间：
2017-11-18 11:18:25
阅读次数：
128
Masha wants to open her own bakery and bake muffins in one of the n cities numbered from 1 to n. There are m bidirectional roads, each of whose connec ...
分类：
其他好文 时间：
2017-11-04 23:30:54
阅读次数：
206
The country Treeland consists of n cities, some pairs of them are connected with unidirectional roads. Overall there are n?-?1 roads in the country. W ...
Constructing Roads Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 24721 Accepted Submission(s): ...
分类：
其他好文 时间：
2017-10-30 19:43:27
阅读次数：
163
//神题目（题目一开始就理解错了）。。。 题目描述 Why did the cow cross the road? Well, one reason is that Farmer John's farm simply has a lot of roads, making it impossible ...
分类：
其他好文 时间：
2017-10-30 14:19:58
阅读次数：
251
It's almost summer time, and that means that it's almost summer construction time! This year, the good people who are in charge of the roads on the tr ...
分类：
其他好文 时间：
2017-10-28 19:49:56
阅读次数：
224
题目： Bob wants to hold a race to encourage people to do sports. He has got trouble in choosing the route. There are N houses and N - 1 roads in his vil ...
分类：
其他好文 时间：
2017-10-25 11:19:35
阅读次数：
98
Rebuilding Roads Description The cows have reconstructed Farmer John's farm, with its N barns (1 <= N <= 150, number 1..N) after the terrible earthqua ...
分类：
其他好文 时间：
2017-10-09 15:27:49
阅读次数：
201
题意：有N个点，有些点已经连接了，然后求出所有点的连接的最短路径是多少。 思路：最小生成树的变形，有的点已经连接了，就直接把他们的权值赋为0，一样的就做最小生成树。 代码： prime： 1 #include <cstdio> 2 #include <iostream> 3 4 using name ...
分类：
其他好文 时间：
2017-10-08 16:07:29
阅读次数：
124
题意： 首先给你一个图，需要你求出最小生成树，首先输入n个节点，用大写字母表示各节点，接着说有几个点和它相连，然后给出节点与节点之间的权值。拿第二个样例举例：比如有3个节点，然后接下来有3-1行表示了边的情况，拿第一行来说：A 2 B 10 C 40表示A有2个邻点，B和C，AB权值是10，AC权值 ...
分类：
其他好文 时间：
2017-10-07 18:42:28
阅读次数：
155
