摘要：
1 //bellman_ford判断负环 2 #include 3 #include 4 #include 5 #include 6 using namespace std; 7 8 const int maxn = 200 + 5; 9 10 int n,m; 11 double v; 12 struct node{ 13 int u, v; 14 ... 阅读全文
摘要：
1 #include <iostream> 2 #include <algorithm> 3 #include <string> 4 #include <cstring> 5 using namespace std; 6 7 int n, m; 8 const int maxn = 105; 9 i 阅读全文
摘要：
1 #include 2 #include 3 #include 4 using namespace std; 5 6 const int INF = 0x3f3f3f3f; 7 const int maxn = 50005; 8 int n, w, m, k, dis[maxn]; 9 10 struct node 11 { 12 int u, v, w; 13 ... 阅读全文
摘要：
1 //两次dijkstra 2 #include 3 #include 4 5 #define Faster ios::sync_with_stdio(false),cin.tie(0) 6 #define Read freopen("in.txt","r",stdin),freopen("out.txt","w",stdout) 7 #define Close fclos... 阅读全文
摘要：
1 //改版dijkstra 2 #include 3 #include 4 5 #define Faster ios::sync_with_stdio(false),cin.tie(0) 6 #define Read freopen("in.txt","r",stdin),freopen("out.txt","w",stdout) 7 #define Close fclos... 阅读全文