摘要：
迪杰斯特拉最短路径。1.every city must wait till all the goods arrive, and then transport the arriving goods together with its own goods to the next city. 这个条件貌似... 阅读全文
摘要：
迪杰斯特拉单源最短路算法。对成语进行预处理。做出邻接矩阵即可。#include#include#include#includeusing namespace std;const int maxn = 1005;int c[maxn], len[maxn], cost[maxn][maxn], fla... 阅读全文