ACM,再见！

http://codeforces.com/problemset/problem/22/EE. Schemetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard output

#include #include #include #include using namespace std;#define M 10005#define N 105struct note{ int v,next;}edge[M];int head[N],dfn[N],low[N],belong[N],index,ip,cnt_tar,count[N];stack

http://acm.hdu.edu.cn/showproblem.php?pid=4738Problem DescriptionCaocao 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 g

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

http://acm.hdu.edu.cn/showproblem.php?pid=2460http://poj.org/problem?id=3694Problem DescriptionA network administrator manages a large network. The network consists of N computers and M

题目链接：http://poj.org/problem?id=3177解题思路：

http://acm.hdu.edu.cn/showproblem.php?pid=4587Problem DescriptionSuppose that G is an undirected graph, and the value of stab is defined as follows:Among the expression,G-i, -j is the

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=737/***Uva 796 求桥题目要求：输出题目中所有的桥，按其所连接的点从小到大的顺序输出解题思路：tarjan算法，所有树枝边都是桥（dfn[u]<low[v]）,利用vector存储一下就可

/*** 求 无向图的割点和桥* 可以找出割点和桥，求删掉每个点后增加的连通块。* 需要注意重边的处理，可以先用矩阵存，再转邻接表，或者进行判重* 调用solve输出割点数，全局变量bridge记录边的个数*/#include #include #include #include using namespace std;const int maxn=10010;co

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=251A Telephone Line Company (TLC) is establishing a new telephone cable network. They are connecting

http://poj.org/problem?id=3259

http://acm.hdu.edu.cn/showproblem.php?pid=4635Problem DescriptionGive a simple directed graph with N nodes and M edges. Please tell me the maximum number of the edges you can add that the gr

http://codeforces.com/problemset/problem/22/CC. System Administratortime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutpu

[点连通度与边连通度]在一个无向连通图中，如果有一个顶点集合，删除这个顶点集合，以及这个集合中所有顶点相关联的边以后，原图变成多个连通块，就称这个点集为割点集合。一个图的点连通度的定义为，最小割点集合中的顶点数。类似的，如果有一个边集合，删除这个边集合以后，原图变成多个连通块，就称这个点集为割边集合。一个图的边连通度的定义为，最小割边集合中的边数。[双连通图、割点与桥]如果一个

http://115.28.76.232/problem?pid=1236Problem Description      Ferry Kingdom is a nice little country located on N islands that are connected by M bridges. All bridges are very beautiful and

http://vjudge.net/contest/view.action?cid=48251#problem/E

如果有向图G的任何两定点都可以相互到达，足额chen

http://poj.org/problem?id=1236DescriptionA number of schools are connected to a computer network. Agreements have been developed among those schools: each school maintains a list of schools to

http://poj.org/problem?id=1904DescriptionOnce upon a time there lived a king and he had N sons. And there were N beautiful girls in the kingdom and the king knew about each of his sons which o