![](https://img-blog.csdnimg.cn/20201014180756724.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
图论 最短路
obsorb_knowledge
心有不甘,呼唤着我
展开
-
POJ - 1135 自己构造图,最短路dijkstar模板求解
You have just moved from a quiet Waterloo neighbourhood to a big, noisy city. Instead of getting to ride your bike to school every day, you now get to walk and take the subway. Because you don't want原创 2017-10-03 14:29:45 · 348 阅读 · 0 评论 -
L2-001. 紧急救援(distar 求最短路的变形)
作为一个城市的应急救援队伍的负责人,你有一张特殊的全国地图。在地图上显示有多个分散的城市和一些连接城市的快速道路。每个城市的救援队数量和每一条连接两个城市的快速道路长度都标在地图上。当其他城市有紧急求助电话给你的时候,你的任务是带领你的救援队尽快赶往事发地,同时,一路上召集尽可能多的救援队。输入格式:输入第一行给出4个正整数N、M、S、D,其中N(2<=N<=500)是城市的个数,顺便...原创 2018-03-17 08:21:13 · 1150 阅读 · 0 评论 -
X FZU - 2271 (给出一个图,能删除至多多少边使得任意两点之间的最短路径不变)
X is a fully prosperous country, especially known for its complicated transportation networks. But recently, for the sake of better controlling by the government, the president Fat Brother thinks it’s...原创 2018-04-26 14:39:49 · 585 阅读 · 0 评论 -
Nearest Maintenance Point CSU - 2005 (堆优化的dijstar + bitset容器的位运算)
A county consists of n cities (labeled 1, 2, …, n) connected by some bidirectional roads. Each road connects a pair of distinct cities. A robot company has built maintenance points in some cities. Now...原创 2018-05-18 14:48:50 · 314 阅读 · 0 评论