https://blog.youkuaiyun.com/lsxyzazh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/lsxyza/article/details/164152483https://blog.youkuaiyun.com/lsxyza/article/details/164152483lsxyzaFri, 28 Aug 2026 19:55:10 +0800=0，不能有负边权不然Dijkstra不能用。对于这道题是与并查集一样都必须先初始化就像下面代码一样，把起点s到自己的距离初始化为0，到其它点的距离初始化为无穷大因为一个数据u有两个条件终点v和边权w，而题目是一条有向边，所以我们只需要用邻接表存一次就好接下来就是用优先队列去存储起点s到每个点的距离和点的编号，这样我们每次都能选出当前距离最小还没确定最短路径的点u。]]>https://blog.youkuaiyun.com/lsxyza/article/details/164151111https://blog.youkuaiyun.com/lsxyza/article/details/164151111lsxyzaFri, 28 Aug 2026 17:56:37 +0800https://blog.youkuaiyun.com/lsxyza/article/details/164063776https://blog.youkuaiyun.com/lsxyza/article/details/164063776lsxyzaTue, 25 Aug 2026 19:34:09 +0800https://blog.youkuaiyun.com/lsxyza/article/details/163893513https://blog.youkuaiyun.com/lsxyza/article/details/163893513lsxyzaWed, 19 Aug 2026 18:17:38 +08000就用多重背包。]]>https://blog.youkuaiyun.com/lsxyza/article/details/163818798https://blog.youkuaiyun.com/lsxyza/article/details/163818798lsxyzaMon, 17 Aug 2026 11:16:40 +0800https://blog.youkuaiyun.com/lsxyza/article/details/163703834https://blog.youkuaiyun.com/lsxyza/article/details/163703834lsxyzaWed, 12 Aug 2026 19:33:16 +0800https://blog.youkuaiyun.com/lsxyza/article/details/163554035https://blog.youkuaiyun.com/lsxyza/article/details/163554035lsxyzaFri, 07 Aug 2026 09:40:52 +0800https://blog.youkuaiyun.com/lsxyza/article/details/163479165https://blog.youkuaiyun.com/lsxyza/article/details/163479165lsxyzaTue, 04 Aug 2026 17:52:28 +0800https://blog.youkuaiyun.com/lsxyza/article/details/163430076https://blog.youkuaiyun.com/lsxyza/article/details/163430076lsxyzaMon, 03 Aug 2026 10:09:40 +0800https://blog.youkuaiyun.com/lsxyza/article/details/163374727https://blog.youkuaiyun.com/lsxyza/article/details/163374727lsxyzaSat, 01 Aug 2026 11:31:20 +0800https://blog.youkuaiyun.com/lsxyza/article/details/163310187https://blog.youkuaiyun.com/lsxyza/article/details/163310187lsxyzaWed, 29 Jul 2026 19:10:35 +0800https://blog.youkuaiyun.com/lsxyza/article/details/163191387https://blog.youkuaiyun.com/lsxyza/article/details/163191387lsxyzaSat, 25 Jul 2026 12:55:38 +0800https://blog.youkuaiyun.com/lsxyza/article/details/163186018https://blog.youkuaiyun.com/lsxyza/article/details/163186018lsxyzaSat, 25 Jul 2026 11:05:21 +0800https://blog.youkuaiyun.com/lsxyza/article/details/163084521https://blog.youkuaiyun.com/lsxyza/article/details/163084521lsxyzaTue, 21 Jul 2026 19:23:06 +0800https://blog.youkuaiyun.com/lsxyza/article/details/163077309https://blog.youkuaiyun.com/lsxyza/article/details/163077309lsxyzaTue, 21 Jul 2026 14:43:10 +0800https://blog.youkuaiyun.com/lsxyza/article/details/161798940https://blog.youkuaiyun.com/lsxyza/article/details/161798940lsxyzaMon, 08 Jun 2026 14:32:16 +0800https://blog.youkuaiyun.com/lsxyza/article/details/161632212https://blog.youkuaiyun.com/lsxyza/article/details/161632212lsxyzaTue, 02 Jun 2026 20:08:28 +0800https://blog.youkuaiyun.com/lsxyza/article/details/161459054https://blog.youkuaiyun.com/lsxyza/article/details/161459054lsxyzaFri, 29 May 2026 17:06:57 +0800https://blog.youkuaiyun.com/lsxyza/article/details/161393958https://blog.youkuaiyun.com/lsxyza/article/details/161393958lsxyzaMon, 25 May 2026 16:17:57 +0800https://blog.youkuaiyun.com/lsxyza/article/details/161323590https://blog.youkuaiyun.com/lsxyza/article/details/161323590lsxyzaFri, 22 May 2026 22:17:05 +0800