题目描述 题目描述 题目描述 There are nn cities and mm roads in Berland. Each road connects a pair of cities. The roads in Berland are one-way. What is the minimum ...
Tour In the kingdom of Henryy, there are N (2 <= N <= 200) cities, with M (M <= 30000) one-way roads connecting them. You are lucky enough to have a c ...
分类：
其他好文 时间：
2018-07-15 11:06:08
阅读次数：
187
题目大意 : 给你一棵 $n$ 个点构成的树基环树，你需要删掉一条环边，使其变成一颗树，并最小化删掉环边后的树的直径。 $n \leq 2 \times 10^5$ 树的边权 $ \leq 10^9 $ ...
分类：
其他好文 时间：
2018-07-12 18:13:59
阅读次数：
186
题目描述 Fennec and Snuke are playing a board game.On the board, there are N cells numbered 1 through N, and N?1 roads, each connecting two cells. Cell ai ...
分类：
其他好文 时间：
2018-07-08 20:03:59
阅读次数：
149
E. Tree Constructing E. Tree Constructing You are given three integers nn, dd and kk. Your task is to construct an undirected tree on nn vertices with ...
分类：
其他好文 时间：
2018-07-07 17:56:34
阅读次数：
163
题目： The Head Elder of the tropical island of Lagrishan has a problem. A burst of foreign aid money was spent on extra roads between villages some year ...
分类：
其他好文 时间：
2018-07-02 23:03:49
阅读次数：
172
题目传送门 传送点I 传送点II 传送点III 题目大意 给定一颗基环树，要求删去其中一条边，使得剩下的图形是一棵树，并且最长路的长度最短，求最长路的最短长度。 传送点I 传送点II 传送点III 题目大意 给定一颗基环树，要求删去其中一条边，使得剩下的图形是一棵树，并且最长路的长度最短，求最长路的 ...
分类：
其他好文 时间：
2018-07-01 17:53:21
阅读次数：
173
In the Kingdom K., there are n towns numbered with integers from 1 to n. The towns are connected by n bi-directional roads numbered with integers from ...
分类：
其他好文 时间：
2018-06-30 12:48:27
阅读次数：
188
Indeed there are many different tourist routes from our city to Rome. You are supposed to find your clients the route with the least cost while gainin ...
分类：
其他好文 时间：
2018-06-14 01:14:55
阅读次数：
194
[POI2008]CLO Time Limit: 10 Sec Memory Limit: 162 MB Description Byteotia城市有n个 towns m条双向roads. 每条 road 连接 两个不同的 towns ,没有重复的road. 你要把其中一些road变成单向边使得： ...
分类：
其他好文 时间：
2018-06-13 11:29:31
阅读次数：
126
