youthinkwhat

多源最大概率，可以用floyd搞一搞。不过快超时了。#include <cstdio>#include <cstring>using namespace std;const int MAXN = 1010;int s, t, n, m;double f[MAXN][MAXN];int main(){ while (~scanf("%d", &n)) { f

求任意两点的最短距离。 floyd；注意处理重边。#include <iostream>#include <cstring>#include <cstdio>#include <algorithm>using namespace std;int dis[220][220];int main(){ int n, m; while(~scanf("%d%d",&n,&m)

单源最短路。spfa。这里给出的地名都是字符串。用map映射一下。#include <cstdio>#include <algorithm>#include <cstring>#include <vector>#include <queue>#include <map>#include <string>#include <iostream>using namespace std;#