![](https://img-blog.csdnimg.cn/20201014180756780.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
dfs
文章平均质量分 82
Mr0cheng
这个作者很懒,什么都没留下…
展开
-
PAT甲级 1013
Battle Over CitiesIt is vitally important to have all the cities connected by highways in a war. If a city is occupied by the enemy, all the highways from/toward that city are closed. We must know imme原创 2017-06-25 18:17:08 · 374 阅读 · 0 评论 -
PAT甲级 1030
Travel PlanA traveler’s map gives the distances between cities along the highways, together with the cost of each highway. Now you are supposed to write a program to help a traveler to decide the short原创 2017-07-17 15:31:05 · 475 阅读 · 0 评论 -
PAT甲级 1021 没有AC,留着重做
Deepest RootA graph which is connected and acyclic can be considered a tree. The height of the tree depends on the selected root. Now you are supposed to find the root that results in a highest tree. S原创 2017-07-09 14:33:59 · 460 阅读 · 0 评论