仅做个人笔记

Travel Plan (30) A 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...

以下代码全都不对，则良机重写！ 1018. Public Bike Management (30) There is a public bike service in Hangzhou City which provides great convenience to the tourists from all over the world. One may rent a bike at a...

初始： G[][]：两点间距离 V[][]：边权 w[]：点权 dijkstra生成： d[]：到原点的最短距离 pre[vector<int>]：当前节点在最短路径上的前驱 DFS： 遍历当前节点的所有上一个前驱节点，判断他们边权和点权的最优值生成一条最优的路径 #include <cstdio> const in...

// Floyd 求任意两点间的最短路长度 --------------------------------------------------------- // 如果 dis[i][k] + dis[k][j] &lt; dis[i][j]; // 则 dis[i][j] = dis[i][k] + disd[k][j]; #include &lt;cstdio&gt; #include &l...

Emergency (紧急时刻). As an emergency rescue(营救) team leader of a city, you are given a special map of your country. The map shows several scattered(分散的) cities connected by some roads. Amount of rescu...