lanshan1111的博客

http://poj.org/problem?id=1144 求割顶 #include<cstdio> #include<cstring> #include<vector> using namespace std; const int maxn = 100+10; int n; int dfs_clock; vector<int> G[maxn...

#include<cstdio> #include<cstring> #include<vector> using namespace std; const int maxn=100000+10; int n,m; int dfs_clock;//时钟，每访问一个节点增1 vector<int> G[maxn];//G[i]表示i节点邻接的所有节点...

https://vjudge.net/problem/20837/origin 求割点问题 该算法是R.Tarjan发明的。对图深度优先搜索，定义DFS(u)为u在搜索树（以下简称为树）中被遍历到的次序号。定义Low(u)为u或u的子树中能通过非父子边追溯到的最早的节点，即DFS序号最小的节点。根据定义，则有： Low(u)=Min { DFS(u) DFS(v) (u,v)为后向边(返祖边...

https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=737 In a computer network a link L, which interconnects two servers, is considered critical...

http://poj.org/problem?id=3694 Description A network administrator manages a large network. The network consists of N computers and M links between pairs of computers. Any pair of computers are conn...

http://acm.hdu.edu.cn/showproblem.php?pid=4612 Problem Description 　　N planets are connected by M bidirectional channels that allow instant transportation. It's always possible to travel betw...

http://acm.hdu.edu.cn/showproblem.php?pid=4738 Problem Description Caocao was defeated by Zhuge Liang and Zhou Yu in the battle of Chibi. But he wouldn't give up. Caocao's army still was not ...

  http://acm.hdu.edu.cn/showproblem.php?pid=3849 让求割边 如果图不连通，输出0 若联通，按顺序输出桥，这里利用了map，便于处理字符串 By Recognizing These Guys, We Find Social Networks Useful Time Limit: 2000/1000 MS (Java/Others...

http://lightoj.com/volume_showproblem.php?problem=1026 In a computer network a link L, which interconnects two servers, is considered critical if there are at least two servers A and B such that all ...

http://poj.org/problem?id=1515 桥输出两遍（正反） 非桥输出一遍 Description According to the Automobile Collision Monitor (ACM), most fatal traffic accidents occur on two-way streets. In order to reduce th...

D. Edges in MST time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output You are given a connected weighted undirected graph without any l...