摘要：
求出加油站两两之间的最短路，判断下即可#include<iostream>#include<cstring>#include <cstdio>#include<string>#include<queue>#include<vector> #include<map>#include <set>#include<ctime>#include<cmath>#include <cstdlib>#include<algorithm>#include <io 阅读全文
摘要：
详细讲解 ：http://www.byvoid.com/blog/biconnect/求割边模版//hint：所给图必须为连通图const int N=100100;struct cutting_edge{ int cnt,scnt; int dfn[N],low[N],vis[N]; vector< pair<int,int> > G[N]; void init(int n){ for(int i=0;i<=n;i++){ G[i].clear(); vis[i]=0; } } voi... 阅读全文
摘要：
kruskal+求割边#include<iostream>#include<cstring>#include <cstdio>#include<string>#include<queue>#include<vector> #include<map>#include <set>#include<ctime>#include<cmath>#include <cstdlib>#include<algorithm>#include <iomanip> 阅读全文